leetcode 100. Same Tree

原创于 2017-09-14 10:26:41 发布 · 195 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

280 篇文章

订阅专栏

本文介绍了一种检查两棵二叉树是否等价的方法。等价是指这两棵树不仅结构相同，而且每个节点的值也完全一致。通过递归方式比较两棵树的根节点、左子树和右子树来实现这一目标。

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

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 && !q)    
            return 1;
        else if ( (!p) ^ (!q) )  // ^ 异或运算符
            return 0;
        else if (p->val == q->val)
            return ( isSameTree(p->left, q->left) && isSameTree(p->right, q->right) );
        else
            return 0;
    }
};