algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0101.对称二叉树.md

Browse Source 
Fixing description issues
This commit is contained in:
HaoYu Dong
2022-11-21 22:21:39 +08:00
committed by GitHub
parent b7d29cbe04
commit f9bddcabeb
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0101.对称二叉树.md
View File

@ -21,7 +21,7 @@
对于二叉树是否对称，要比较的是根节点的左子树与右子树是不是相互翻转的，理解这一点就知道了**其实我们要比较的是两个树（这两个树是根节点的左右子树）**，所以在递归遍历的过程中，也是要同时遍历两棵树。
那么如果比较呢？
那么如何比较呢？
比较的是两个子树的里侧和外侧的元素是否相等。如图所示：