Same Tree
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.
思路:
简单的递归,类似前序遍历,遇到不同返回false, 直到便利结束。
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null && q==null){
return true;
}
if(p==null || q==null){
return false;
}
if(p.val != q.val ){
return false;
}
if(!isSameTree(p.left, q.left))
{
return false;
}
if(!isSameTree(p.right, q.right)){
return false;
}
return true;
}