LeetCode 100
2020.8.15
我的通过代码
/**
* 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 {
boolean flag = true;
public boolean isSameTree(TreeNode p, TreeNode q) {
traverse(p,q);
return flag;
}
void traverse(TreeNode p, TreeNode q) {
if(p==null&q==null) return;
if(p==null||q==null) {
flag = false;
return;
} else {
if(p.val==q.val) {
traverse(p.left,q.left);
traverse(p.right,q.right);
} else {
flag = false;
return;
}
}
}
}
没啥难的,两棵树一起遍历即可。