题目:
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.
解题:依次遍历每一个点,如果都为Null或是都不为null且值相等 返回true,一个为Null另一个不为Null返回false 两个都不为null但值不相等返回false。
代码:
public static 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;
return isSameTree(p.left, q.left)&&isSameTree(p.right, q.right);
}