LeetCode 100. Same Tree

LeetCode 100. Same Tree

题目描述

原题链接：
https://leetcode.com/problems/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

解决方案

用时12ms，内存消耗10.1MB。也可以加入减枝操作进行优化，当两棵树的左子树不相同则直接返回false。

class Solution {
public:
    bool isSameTree(TreeNode* p, TreeNode* q) {
    if(p==NULL&&q==NULL)return true;
    if(p!=NULL && q!=NULL && p->val==q->val  ){
        return isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
    }else {
        return false;
    }
}
};