Same Tree —— Leetcode

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.

递归之下，简单的不能再简单了。

代码：

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isSameTree(TreeNode *p, TreeNode *q) {
        if(!p && !q)    return true;
        if(!p&&q || p&&!q || p->val != q->val)  return false;
        return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
    }
};