题目描述:
思路:想到两种方法:1.递归查看每个结点是否相同。2.用栈或队列查看结构。
给出递归的做法:
/**
* 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 {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p==null&&q==null)return true;
else if(p==null||q==null)return false;
else if(p.val!=q.val)return false;
else return isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
}
}