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.
解题思路:
JAVA实现如下:
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null||q==null)
return p==null&&q==null;
if(p.val!=q.val)
return false;
return(isSameTree(p.left,q.left)&&isSameTree(p.right,q.right));
}
本文提供了一个Java函数,用于判断两个给定的二叉树是否结构相同且节点值相等。
8万+

被折叠的 条评论
为什么被折叠?



