【LeetCode】100. Same Tree

Description：

Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Example 1:

Input:     1         1
          / \       / \
         2   3     2   3

        [1,2,3],   [1,2,3]

Output: true

Example 2:

Input:     1         1
          /           \
         2             2

        [1,2],     [1,null,2]

Output: false

Example 3:

Input:     1         1
          / \       / \
         2   1     1   2

        [1,2,1],   [1,1,2]

Output: false

题目就是判断两个二叉树是否相同。看了讨论区的代码。这道题对自己来说也很值得研究，虽然代码很短，但是思维很巧。

/**
 * 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(p==NULL || q==NULL)
           return (p==q);//当q或p有一个或两个为空，则直接返回p==q.如果只有一个为空，则返回false，两个都为空则返回true
        return (p->val==q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right));//用递归，很简洁的代码。
        
    }
};