leetcode 101: Symmetric Tree
解题思路:
先比较根节点的左子节点和右子节点,然后递归判断,左子节点的左子树与右子节点的右子树,左子节点的右子树与右子节点的左子树原题目:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,
原创
2016-10-24 12:15:25 ·
230 阅读 ·
0 评论