leetCode--same-tree
2017-06-30 14:33
411 查看
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
分析：很简单，先比较父节点是否相同，在比较各自的子节点即可
public class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null&&q==null){
return true;
}
if(p==null||q==null){
return false;
}
return p.val==q.val&&isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
}
}
分析：很简单，先比较父节点是否相同，在比较各自的子节点即可
public class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null&&q==null){
return true;
}
if(p==null||q==null){
return false;
}
return p.val==q.val&&isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode Same Tree
- Same Tree —— Leetcode
- leetcode:100 Same Tree－每日编程第六题
- [leetcode]Same Tree @ Python
- LeetCode Same Tree
- LeetCode -- Same Tree 代码分析
- leetcode same tree
- LeetCode---Same Tree
- LeetCode Same Tree
- LeetCode@Tree_100_Same_Tree
- LeetCode:Same Tree && Reverse Integer
- Same Tree [LeetCode]
- LeetCode Same Tree 简单，简洁的递归解法
- LeetCode Same Tree 决定是否是相同的树
- LeetCode Same Tree
- LeetCode -- Same Tree
- leetcode:SameTree java python
- LeetCode Same Tree
- leetcode Same Tree
- LeetCode：same_tree题解