Same Tree ---LeetCode

https://leetcode.com/problems/same-tree/

解题思路：

姑且认为有这么几种情况下两棵树是不相等的，一是长度不等，而是节点的值不等。所以我们用递归，如果都躲过了这两个条件直到遍历到叶子节点，那么这两棵树就是相等的。

/**
 * Definition for a binary tree node.
 * 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);
    }
}