LeetCode 100. Same Tree

最新推荐文章于 2024-07-18 16:07:51 发布

柳婼

最新推荐文章于 2024-07-18 16:07:51 发布

阅读量347

点赞数

CC 4.0 BY-SA版权

文章标签： LeetCode

本文链接：https://blog.csdn.net/liuchuo/article/details/51994115

LeetCode 专栏收录该内容

350 篇文章

订阅专栏

本文介绍了一种判断两棵二叉树是否相同的算法。通过递归比较每对节点的值及左右子树来确保结构与数值完全一致。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

100. Same Tree
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.

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