题目要求:
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 a binary tree node.
* 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)
{
return true;
}
if((p==null&&q!=null)||(p!=null&&q==null))
{
return false;
}
if(p.val!=q.val)
{
return false;
}
return (isSameTree(p.left,q.left)&&isSameTree(p.right,q.right));
}
}