leetcode—Same Tree

最新推荐文章于 2025-08-10 21:15:24 发布

weixin_33852020

最新推荐文章于 2025-08-10 21:15:24 发布

阅读量53

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法 c/c++

原文链接：http://www.cnblogs.com/obama/p/3260934.html

本文介绍了一种通过深度优先搜索来判断两个二叉树是否完全相同的方法。该方法首先检查根节点是否相同，然后递归地比较每个子节点。

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

1.题目描述

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.

2.解法分析

与上一篇文章“Symmetric Tree”一样的思路，只是要证明两棵树完全一样，需对两棵树进行一模一样的遍历。当然最好是深度搜索。

/**

 * 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

        vector<TreeNode *> vp;

        vector<TreeNode *> vq;

        TreeNode *curp= p;

        TreeNode *curq =q;

        while(curp||!vp.empty())

            while(curp)

                if(!curq)return false;

                if(curp->val!=curq->val)return false;

                vp.push_back(curp);

                vq.push_back(curq);

                curp=curp->left;

                curq=curq->left;

            if(!vp.empty())

                if(curp)return false;

                curp=vp.back();vp.pop_back();curp=curp->right;

                curq=vq.back();vq.pop_back();curq=curq->right;

        if((vp.empty()&&!vq.empty())||(!vp.empty()&&vq.empty()))return false;

        if((curp&&!curp)||(!curp&&curq))return false;

        return true;

};

转载于:https://www.cnblogs.com/obama/p/3260934.html