Leetcode 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.

---

解题思路：

递归判断左右是否相等。

---

 Java code:

 public boolean isSameTree(TreeNode p, TreeNode q) {
        //use recursive
        if(p == null && q == null) {
            return true;
        }
        if(p == null || q == null) {
            return false;
        }
        return (p.val == q.val) && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }

---

Reference:

1. http://www.cnblogs.com/springfor/p/3879575.html