Same Tree 比较是否是相同的树@ LeetCode

题目：

给定两个二叉树，比较两个二叉树是否相同

思路：

递归。

base case：

如果两树都为空树，则true

一空一不空，则false

general：

先比较根节点是否相等，然后再递归比较左右子树

/**
 * Same Tree
 * 
 * Given two binary trees, write a function to check if they are equal or not.
 * 
 * Two binary trees are considered equal if they are structurally identical and
 * the nodes have the same value.
 * 
 */
public class S100 {

	public static void main(String[] args) {
		
	}
	
	
	public boolean isSameTree(TreeNode p, TreeNode q) {
		// 如果同时为空，则相等
        if(p==null && q==null){
        	return true;
        }else if(p==null || q==null){	// 如果一个空一个不空，则不等
        	return false;
        }
        
        if(p.val == q.val){		// 如果节点值相等，继续检查p，q的左右子树
        	return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
        }else{
        	return false;
        }
    }

}

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public 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 false;
        }
        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }
}