给定两棵二叉树,判断两棵树是否相同。
采用先序的方法遍历:
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p == null || q == null) return p==q;
if(p.val == q.val)
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
return false;
}
给定两棵二叉树,判断两棵树是否相同。
采用先序的方法遍历:
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p == null || q == null) return p==q;
if(p.val == q.val)
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
return false;
}