Question
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.
Code
public boolean isSameTree(TreeNode p, TreeNode q) {
return judge(p, q);
}
public boolean judge(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 judge(p.left, q.left) && judge(p.right, q.right);
}
本博客提供了一个函数,用于判断两个给定的二叉树是否结构相同且节点值相等。
355

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



