題目描述
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
分析：給定兩個二叉樹茂蚓，判斷這兩個二叉樹是否一樣溉仑。
我的Code如下：
/**
* 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) {
//比較到最后的時候會出現(xiàn)都為null的情況
if(p==null && q==null){
return true;
}
//如果一個為空澜搅，一個不為空的情況
if(p==null || q==null){
return false;
}
boolean flag = true;
while(p!=null){
if(p.val != q.val){
return false;
}
return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
}
return flag;
}
}
