【leetcode】same-tree

最新推荐文章于 2019-03-17 14:36:00 发布

原创最新推荐文章于 2019-03-17 14:36:00 发布 · 173 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一种算法，用于检查两棵二叉树是否在结构上相同且节点值相等。通过递归方式比较两棵树的每个节点，确保它们在结构和值上完全一致。

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