【树】相同的树

题目：

 

 

解答：

用树的遍历来检查。

 

/**
 * Definition for a binary tree node.
 * 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 (NULL == p && NULL == q)
        {
            return true;
        }

        if (NULL == p || NULL == q)
        {
            return false;
        }

        bool leftsame = isSameTree(p->left, q->left);
        bool rightsame = isSameTree(p->right, q->right);

        return leftsame && rightsame && p->val == q->val;
    }
};