100 相同的树
同步遍历两棵树,比对是否值相等,注意判空。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
private boolean flag = true;
public void checkTree(TreeNode p, TreeNode q){
if (p == null && q == null) return;
// 其中一个节点为空
if (p == null || q == null){
flag = false;
return;
}
// 值不相等
if (p.val != q.val){
flag = false;
return;
}
checkTree(p.left, q.left);
checkTree(p.right, q.right);
}
public boolean isSameTree(TreeNode p, TreeNode q) {
checkTree(p, q);
return flag;
}
}