Leetcode---Same Tree

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

本文介绍了一个用于判断两棵二叉树是否相同的函数实现。通过递归比较两棵树的节点值及其左右子树来确定它们是否结构相同且节点值相等。

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.


很像那个镜像的树，思想完全一样。


  1. bool isSameTree(TreeNode *p, TreeNode *q) {
  2.     if(p==NULL && q==NULL)
  3.         return true;
  4.     if(p==NULL || q==NULL)
  5.         return false;
  6.     return p->val==q->val && isSameTree(p->left,q->left) && isSameTree(p->right,q->right);
  7. }


<script>window._bd_share_config={"common":{"bdsnskey":{},"bdtext":"","bdmini":"2","bdminilist":false,"bdpic":"","bdstyle":"0","bdsize":"16"},"share":{}};with(document)0[(getelementsbytagname('head')[0]||body).appendchild(createelement('script')).src='http://bdimg.share.baidu.com/static/api/js/share.js?v=89860593.js?cdnversion='+~(-new date()/36e5)];</script>
阅读(7) | 评论(0) | 转发(0) |
0

上一篇：Leetcode---Maximum Depth of Binary Tree

下一篇：Leetcode---Balanced Binary Tree

相关热门文章
给主人留下些什么吧！~~
评论热议
java-leetcode-100-same-tree
08-13
java java_leetcode-100-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-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-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，返回
LeetCode---Same Tree
找到生活的 节奏&&驱动力
09-21 310
题目大意： 给出两颗二叉树，判断他们是否相等。相等的二叉树具有相同的结构和节点元素值。 算法思想： 递归。让节点都非空的时候返回(p->val==q->val)&&isSameTree(p->left,q->left)&&isSameTree(p->right, q->right)的布尔值，当节点都为空的时候返回True,否则返回false. 代码如下： /** * Definitio
leetcode---Same Tree
新博客：https://aping-dev.com/
04-09 241
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 f
leetcode--Same Tree
非淡泊无以明志，非宁静无以致远
08-08 246
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.
LeetCode: same-tree
山鬼谣弋痕夕的博客
04-23 314
题目描述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.判断两个二叉树是否相等，返回...
LeetCode --- Same Tree
滴水穿石!
05-30 471
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 same value.
LeetCode - Same Tree 100
程序人生的博客
08-12 243
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 value. Example ...
LeetCode--Same Tree
小二杰的博客
11-03 238
题目: 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. 代码:
python-leetcode题解之100-Same-Tree
09-03
在解决LeetCode中的“100-Same-Tree”题目时，我们关注的是如何使用Python语言来检查两棵二叉树是否完全相同。这个问题是算法与数据结构领域中二叉树比较的经典问题，对于理解树结构及其遍历方法尤为重要。在本题解...
js-leetcode题解之100-same-tree.js
最新发布
10-30
在js-leetcode题解之100-same-tree.js这个文件中，开发者将能获取到如何用JavaScript语言解决LeetCode中“Same Tree”问题的具体实现示例，这不仅仅是对树结构相等问题的一个解答，更是一种递归思想和算法逻辑的展示...
精选资源
leetcode-js:算法和数据结构是一个程序员的灵魂，LeetCode JavaScript TypeScript 题解
04-28
leetcode-js Leecode 经典题目 JavaScript TypeScript 题解...100.相同的树 (Same Tree) 104.二叉树的最大深度 (Maximum Depth of Binary Tree) 118.杨辉三角 (Pascal's Triangle) 119.杨辉三角 II (Pascal's Triangle)
Leetcode---Implement strStr()
Walk More Slowly
01-02 795
Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. 我试着用了最简单的匹配，居然过了，以后再用KMP之类的好好研究一下。 char *str
Leetcode题目索引
Walk More Slowly
01-02 737
1 Two Sum Medium 2 Add Two Numbers Medium 3 Longest Substring Without Repeating Characters Medium 4 Median of Two Sorted Arrays Hard 5 Longest Palindromic Substring Mediu
Leetcode---Recover Binary Search Tree
Walk More Slowly
04-06 620
一个二叉排序树的某两个节点颠倒了为了，去恢复它。 不可思议的是这道题居然被标记为了hard，其实难度远低于其他的hard或medium。 思路：中序遍历，然后看是不是递增的，如果不是，记录下来。注意，可能有一次逆序，也可能有两次，一次的发生在相邻节点。 注意，中序遍历是这样的： void f(node * root){ if(root==NULL) return; f
Leetcode---Flatten Binary Tree to Linked List
Walk More Slowly
01-02 594
Given a binary tree, flatten it to a linked list in-place. 这题直观的做法就是先序遍历，一个节点一个节点的塞到list里面，但是为了避免毁掉原本的链接，所以在递归中使用临时变量存储节点 TreeNode * p=NULL; void f(TreeNode * root){
Leetcode---Decode Ways
Walk More Slowly
01-02 581
A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the tot
LeetCode JS/TS题解：掌握算法与数据结构核心
相同的树 (Same Tree)" 这是一个树结构的比较问题，需要检查两棵树是否完全相同。可以通过递归遍历两棵树的节点并比较值来实现。 8. "104. 二叉树的最大深度 (Maximum Depth of Binary Tree)" 题目要求计算给定...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值