LeetCode_Same Tree

最新推荐文章于 2025-09-10 15:16:07 发布

weixin_30788619

最新推荐文章于 2025-09-10 15:16:07 发布

阅读量94

点赞数

CC 4.0 BY-SA版权

文章标签： c/c++

原文链接：http://www.cnblogs.com/graph/archive/2013/04/16/3024451.html

本文提供了一种方法来检查两棵二叉树是否相等。通过递归地比较两个二叉树的节点值及左右子树来实现。只有当两棵树在结构上完全相同且每个对应节点的值也相同时，才认为这两棵树是相等的。

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 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(p == NULL && q == NULL) return true;
        if(p == NULL || q ==NULL) return  false;
        if(p->val == q->val)
         return isSameTree(p->left,q->left)&&isSameTree(p->right, q->right);
        
        return false ;
    }
};