Symmetric Tree
来源:互联网 发布:华南理工大学 知乎 编辑:程序博客网 时间:2024/06/02 03:00
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,3,4,4,3]
is symmetric:
1 / \ 2 2 / \ / \3 4 4 3
But the following [1,2,2,null,3,null,3]
is not:
1 / \ 2 2 \ \ 3 3
Note:
Bonus points if you could solve it both recursively and iteratively.
- Difficulty: Easy
/** * Given a binary tree, check whether it is a mirror of itself (ie, symmetric * around its center). * @author ning */public class SymmetricTree {public boolean isSymmetric(TreeNode root) {return root == null || isSymmetricHelp(root.left, root.right);}//递归比较左子树的左节点和右子树的右节点以及左子树的右节点和右子树的左节点。private boolean isSymmetricHelp(TreeNode left, TreeNode right) {if (left == null || right == null)return left == right;if (left.val != right.val)return false;return isSymmetricHelp(left.left, right.right) && isSymmetricHelp(left.right, right.left);}}
0 0
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- Symmetric Tree
- 安装opencv 3.0.2 与 python3.5
- 一段关于在nodejs 中处理cookie的代码
- watchdog调试总结
- C语言------选择排序
- 网络流
- Symmetric Tree
- java面向对象笔记1
- C++ STL中Map的按Key排序和按Value排序
- ssm项目的简单搭建
- CSS属性display和visibility 区别
- 238. Product of Array Except Self
- QT初学之父子窗体
- 什么时候使用静态static?
- Annotation