Leetcode 100. Same Tree

最新推荐文章于 2025-09-11 19:19:55 发布

ruihuank

最新推荐文章于 2025-09-11 19:19:55 发布

阅读量122

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 笔记文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/ruihuank/article/details/78955281

leetcode 笔记专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一种用于检查两棵二叉树是否完全相同的算法。该算法通过递归比较两棵树的结构和节点值来判断它们是否一致。文章提供了一个简洁高效的 C++ 实现方案。

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.

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

参考后
别人的代码，美到想哭

/**
 * 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 == nullptr || q == nullptr) return p == q;
        return (isSameTree(p->left, q->left) && (p->val == q->val) && isSameTree(p->right, q->right));
    }
};