LeetCode-100. Same Tree

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

原创最新推荐文章于 2024-10-14 18:27:49 发布 · 272 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一种用于检查两棵二叉树是否等价的方法。等价的定义为两棵树不仅结构相同，而且每个对应节点的值也相同。通过递归地比较两棵树的根节点、左子树及右子树来实现这一功能。

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

比较两棵树是否相同。

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