Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 17 additions & 2 deletions C++/chapTree.tex
Original file line number Diff line number Diff line change
Expand Up @@ -828,10 +828,25 @@ \subsection{Symmetric Tree}


\subsubsection{描述}
Given two binary trees, write a function to check if they are equal or not.
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
For example, this binary tree is symmetric:
\begin{Code}
1
/ \
2 2
/ \ / \
3 4 4 3
\end{Code}

But the following is not:
\begin{Code}
1
/ \
2 2
\ \
3 3
\end{Code}

\subsubsection{分析}
Expand Down
Binary file modified C++/leetcode-cpp.pdf
Binary file not shown.