【LeetCode】Identical Binary Tree等价二叉树
来源:互联网 发布:双源abo乐乎 编辑:程序博客网 时间:2024/06/08 18:34
等价二叉树
检查两棵二叉树是否等价。等价的意思是说,首先两棵二叉树必须拥有相同的结构,并且每个对应位置上的节点上的数都相等。
1 1 / \ / \ 2 2 and 2 2 / /4 4
就是两棵等价的二叉树。
1 1 / \ / \ 2 3 and 2 3 / \4 4
就不是等价的。
(1)Java
/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * this.val = val; * this.left = this.right = null; * } * } */public class Solution { /** * @param a, b, the root of binary trees. * @return true if they are identical, or false. */ public boolean isIdentical(TreeNode a, TreeNode b) { if(a == null && b == null){ return true; } if(a == null && b != null|| a != null & b == null){ return false; } return a.val == b.val && isIdentical(a.left,b.left) && isIdentical(a.right,b.right); //等价条件:判断两棵Tree是否同构,同构的定义是可以通过交换左右子树使得他们相同 }}
阅读全文
1 0
- 【LeetCode】Identical Binary Tree等价二叉树
- 469.Identical Binary Tree-等价二叉树(容易题)
- LeetCode Identical Binary Tree 相同二叉树
- Identical Binary Tree
- lintcode:Identical Binary Tree
- [Microsoft] Identical Binary Tree
- 【LeetCode】Balanced Binary Tree,平衡二叉树
- [LeetCode] Balanced Binary Tree 平衡二叉树
- Leetcode Balanced Binary Tree 平衡二叉树
- [LeetCode][二叉树]Invert Binary Tree
- [LeetCode][二叉树]Balanced Binary Tree
- [LeetCode][二叉树]Balanced Binary Tree
- LeetCode随笔之Binary Tree(二叉树)
- LeetCode Invert Binary Tree 翻转二叉树
- leetcode Binary Tree Tilt 二叉树
- 【LeetCode】Invert Binary Tree 翻转二叉树
- Same Tree(等价二叉树)
- 二叉树Binary Tree
- 使用Aspose.Cells.dll导出数据到Excel
- orm与数据持久化
- model1(jsp+javaBean)和model2(jsp+servlet+javaBean+MVC)开发模式优缺点
- Unable to resolve target 'android-17'解决方法
- <Web>jQuery黑客帝国,数字下落特效!
- 【LeetCode】Identical Binary Tree等价二叉树
- 通过调用函数来实现乘法表的打印
- tablelayout_demo2
- hdu 5983Pocket Cube(16青岛现场赛)一步能否还原二层魔方?
- C++引用形参的好处
- JS实现加减乘除四则运算器
- okhttp登录 注册 请求数据
- MVP注册登录
- bootstrap-table组合表头