Leetcode-100. Same Tree

最新推荐文章于 2024-10-14 18:27:49 发布

weixin_30662109

最新推荐文章于 2024-10-14 18:27:49 发布

阅读量97

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/hongyang/articles/5962469.html

本文提供了一种方法来判断两棵二叉树是否相同。通过递归比较节点值及子树结构，确保每一步都完全匹配。适用于需要验证数据结构一致性的场景。

100. Same Tree

QuestionEditorial Solution

My Submissions

Total Accepted: 159908
Total Submissions: 358174
Difficulty: Easy
Contributors: Admin

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.

Subscribe to see which companies asked this question

code:

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