【LeetCode】100. Same Tree

Juxin_Lin

于 2017-01-07 18:53:35 发布

阅读量211

点赞数

分类专栏：递归 DFS leetcode 文章标签：递归 DFS leetcode

本文链接：https://blog.csdn.net/Juxin_Lin/article/details/54177069

版权

leetcode 同时被 3 个专栏收录

39 篇文章 0 订阅

订阅专栏

递归

3 篇文章 0 订阅

订阅专栏

DFS

2 篇文章 0 订阅

订阅专栏

Difficulty: Easy

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.

判断两棵树是否相等，则需要判断当前节点是否相等，并且判断左子树和右子树是否相等

算法时间复杂度为O（logn）

/**
 * 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 true;
        else if(p==NULL||q==NULL) return false;
        
        if(p->val!=q->val)  return false;
        else
            return (isSameTree(p->left,q->left)&&isSameTree(p->right,q->right));
    }
};