leetcode-100-same tree

最新推荐文章于 2021-01-15 22:01:29 发布
原创 最新推荐文章于 2021-01-15 22:01:29 发布 · 175 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文介绍了一种用于判断两棵二叉树是否完全相同的算法实现。通过递归方式逐层对比两个二叉树的节点值及左右子树，确保所有对应节点都相等且结构一致。 
/**
 * 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 == NULL && q == NULL)
            return true;
        if((p == NULL && q != NULL) || (p != NULL && q == NULL))
            return false;
        if(p->val == q->val){
            if(isSameTree(p->left, q->left) && isSameTree(q->right, p->right))
                return true;
            else
                return false;
        }
        else
            return false;
    }
};

递归有点晕，后面再来看看

java-leetcode-100-same-tree
08-13
java java_leetcode-100-same-tree
python-leetcode题解之100-Same-Tree
09-03
在解决LeetCode中的“100-Same-Tree”题目时，我们关注的是如何使用Python语言来检查两棵二叉树是否完全相同。这个问题是算法与数据结构领域中二叉树比较的经典问题，对于理解树结构及其遍历方法尤为重要。在本题解...
leetcode-100-SameTree
Kang_TJU的博客
01-16 550
问题题目：[leetcode-100]思路典型的递归判断即可。代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ bool isSameTree(st
leetcode-100-Same Tree
早睡早起好少年
06-21 417
Same Tree 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
LeetCode-same-tree
六月二十七的博客
04-03 186
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. /** * Defini...
LeetCode-100-Same Tree-E
文卿的藏剑山庄
02-06 136
判断两个二叉树是否完全相同 我的解法： bool isSameTree(TreeNode* p, TreeNode* q) { if(p==NULL&&q==NULL) return true; else if(p==NULL&&q!=NULL||q==NULL&&p!=NULL) return false; if(p->val!
LeetCode-100 Same Tree
秦智慧的博客
01-15 163
Description Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value. Constraints: • The number of nod
leetcode-100. Same Tree
link98
11-26 423
100. Same Tree Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and the nodes have the
LeetCode - Easy - 100. Same Tree
KISS
12-13 217
Topic Tree, Depth-first Search Description https://leetcode.com/problems/same-tree/ Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and the nodes hav
LeetCode-100. Same Tree
zy2317878的博客
04-08 248
Description Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and the nodes have the same v...
LeetCode-E-Same Tree
hfsmurf的博客
04-06 331
题目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.解法递归实现： 均为null，返回
js-leetcode题解之100-same-tree.js
最新发布
10-30
在js-leetcode题解之100-same-tree.js这个文件中，开发者将能获取到如何用JavaScript语言解决LeetCode中“Same Tree”问题的具体实现示例，这不仅仅是对树结构相等问题的一个解答，更是一种递归思想和算法逻辑的展示...
leetcode答案-leetcode-java:leetcode的Java代码
06-30
leetcode 答案leetcode-java leetcode.com 的 Java 答案 ================索引================ com.leetcode.array Search a ...com.leetcode.list ...com.leetcode.string ...com.leetcode.tree ...Same Tree
leetcode-141-link list cycle
VigorQQ的博客
07-24 335
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: bool hasCyc...
leetcode-122-best time to buy and sell stock II
VigorQQ的博客
07-09 308
class Solution { public: int maxProfit(vector<int>& prices) { int max=0; int len = prices.size(); for(int i=1;i<len;i++){ if(prices[i]>prices[i-...
leetcode-22-generate parantheses
VigorQQ的博客
08-24 273
class Solution { public: vector<string> generateParenthesis(int n) { vector<string> result; searchDfs(n, n, "", result); return result; } void sea...
leetcode-8-string to integer(atoi)
VigorQQ的博客
08-22 272
class Solution { public: int myAtoi(string str) { int len = str.size(); long long result = 0; int index; bool flag = false; for(int i=0; i<len;...
leetcode-168-excel sheet column title
VigorQQ的博客
07-29 266
class Solution { public: string convertToTitle(int n) { string result = ""; while(n) { result = (char)((n-1)%26+'A') + result; n = (n-1)/26; ...
leetcode-110-balanced binary tree
VigorQQ的博客
07-08 262
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ clas...
Leetcode算法练习题解及Java实现
19. 100_SameTree（相同的树）：给定两个二叉树，编写一个函数来检验它们是否相同。如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。 以上知识点和算法问题，都是软件开发者在日常工作中可能会...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值