Leetcode--Same Tree

最新推荐文章于 2021-01-15 22:01:29 发布

yskyj

最新推荐文章于 2021-01-15 22:01:29 发布

阅读量302

点赞数

分类专栏： Leetcode 文章标签： leetcode Same Tree

本文链接：https://blog.csdn.net/yskyj/article/details/40452195

版权

Leetcode 专栏收录该内容

75 篇文章 0 订阅

订阅专栏

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.

Show Tags

Tree Depth-first Search

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