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.
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null||q==null){
if(p==null&&q==null){
return true;
}else{
return false;
}
}
if(isSameTree(p.left,q.left)==true&&isSameTree(p.right,q.right)==true&&p.val==q.val){
return true;
}else{
return false;
}
}
}
[LeetCode]Same Tree,布布扣,bubuko.com
原文：http://blog.csdn.net/guorudi/article/details/38355805