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.

给定两个二叉树，写一个函数检查这两个二叉树是否相同。

两个二叉树相同必须是他们的结构相同并且节点的值也相同。

只要同时递归遍历比较左支和右支是否相同就好了，只有一个为空一个有值或者两个值不等时才返回false，其余情况都返回true，代码如下：

/**
 * 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);
    }
};