题目:
Given two binary trees, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
Example 1:
Input: 1 1 / \ / \ 2 3 2 3 [1,2,3], [1,2,3] Output: true
Example 2:
Input: 1 1 / \ 2 2 [1,2], [1,null,2] Output: false
Example 3:
Input: 1 1 / \ / \ 2 1 1 2 [1,2,1], [1,1,2] Output: false
思路解析:
判断两棵树是不是同一棵树,需要判断每个节点都相同。由于树这种特殊的结构,解答树有关的问题通常需要用递归来实现,本题也不例外。
首先判断两棵树是否都为空,都为空返回true;
既然第一步已经判断两颗树是否都为空,接下来只需要判断其中有一颗为空就可以直接返回false;
判断该节点的值是否相等,递归左右两个孩子。
代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean 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);
}
return false;
}
}