100.Same Tree
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.
给定两个二叉树,写一个方法判断他们是否相等。
两个二叉树相等需满足条件:结构相同,对应节点有相等的值。
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public boolean isSameTree(TreeNode p, TreeNode q) {
if((p == null && q == null)){
return true;
}
if(p == null || q == null){
return false;
}
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right) && p.val == q.val;
}
public boolean isSameTree3(TreeNode p, TreeNode q) {
if (p == null && q == null) return true;
return p != null && q != null && p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}
public boolean isSameTree1(TreeNode p, TreeNode q){
Stack<TreeNode> stack_p = new Stack<>();
Stack<TreeNode> stack_q = new Stack<>();
if(p == null && q == null) return true;
if(p == null || q == null) return false;
stack_p.push(p);
stack_q.push(q);
while(!stack_p.isEmpty() && !stack_q.isEmpty()){
TreeNode po = stack_p.pop();
TreeNode qo = stack_q.pop();
if(po.val != qo.val) return false;
if(po.left != null) {stack_p.push(po.left);}
if(qo.left != null) {stack_q.push(qo.left);}
if(stack_p.size() != stack_q.size()) return false;
if(po.right != null) {stack_p.push(po.right);}
if(qo.right != null) {stack_q.push(qo.right);}
if(stack_p.size() != stack_q.size()) return false;
}
return stack_p.size() == stack_q.size();
}