代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public bool IsSameTree(TreeNode p, TreeNode q) {
if(p==null&&q==null) return true;
if(p==null||q==null) return false;
if(p.val==q.val)
return IsSameTree(p.left,q.left)&&IsSameTree(p.right,q.right)?true:false;
return false;
}
}
思路
递归思想
判断当前节点是否相等后
继续往下判断其左右节点是否都相等 从而遍历整个树