leetcode 101. Symmetric Tree

最新推荐文章于 2020-03-19 16:43:39 发布

原创最新推荐文章于 2020-03-19 16:43:39 发布 · 179 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

22 篇文章

订阅专栏

本文介绍了一种使用递归方法来判断二叉树是否对称的有效算法。通过比较左子树与右子树相应节点的方式实现，时间复杂度为O(n)。

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

题目：

要求判断一棵二叉树是否对称

思路：采用递归的办法，直接比较对称位置，即将left的left和right的right比较，left的right和right的left比较。时间复杂度为O(n)。

代码AC：

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

hui1140621618

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
分享

复制链接

分享到 QQ

分享到新浪微博

扫一扫
举报

举报

专栏目录

LeetCode --- 101. Symmetric Tree解题报告

杨鑫newlife的专栏

06-18

282

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree[1,2,2,3,4,4,3]is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 ...

【LeetCode 面试经典150题】101. Symmetric Tree 对称二叉树

qq_43513394的博客

01-17

429

Given the of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).给定一个二叉树的根节点，检查它是否是自己的镜像（即，围绕其中心对称）。输入: = [1,2,2,3,4,4,3] 输出: true输入: = [1,2,2,null,3,null,3] 输出: false能否同时使用递归和迭代方法解决此问题？该方法用于检查二叉树是否关于其中心对称，通过递归比较树的

参与评论您还未登录，请先登录后发表或查看评论

LeetCode 101. Symmetric Tree 对称二叉树

zhangzhetaojj的博客

06-17

617

题目：

Leetcode 101. Symmetric Tree

BJUT_bluecat的博客

04-25

232

/** * 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 101. Symmetric Tree

Allenlzcoder的博客

06-20

278

LeetCode 101. Symmetric Tree Solution1 参考《剑指offer》上的解法：https://blog.csdn.net/allenlzcoder/article/details/79769550 /** * Definition for a binary tree node. * struct TreeNode { * int val; * ...

LeetCode 101.Symmetric Tree python

ma412410029的博客

05-28

303

题目描述：给定一个二叉树，检查它是否镜像对称的。例如二叉树[1,2,2,3,4,4,3]是对称的。 1 / \ 2 2 / \ / \ 3 4 4 3但是下面这个[1,2,2,null,3,null,3]则是不镜像对称的： 1 / \ 2 2 \ \ 3 3分析：递归调用check函数，如果两个节点都是空，则返回tr...

LeetCode 101.Symmetric Tree (对称二叉树)

amoscykl的博客

10-01

261

题目描述：给定一个二叉树，检查它是否是镜像对称的。例如，二叉树[1,2,2,3,4,4,3]是对称的。 1 / \ 2 2 / \ / \ 3 4 4 3 但是下面这个[1,2,2,null,3,null,3]则不是镜像对称的: 1 / \ 2 2 \ \ 3 3 说明: 如果你可以运用递归和...

leetcode101. Symmetric Tree

中华小当家的博客

03-19

172

题目描述 Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / 2 2 / \ / 3 4 4 3 But the fol...

Leetcode 101.Symmetric Tree

mrbm_lj的博客

01-02

171

树的很多题目都是对根结点(或者当前结点) 进行处理之后, 再对子结点进行处理. 本题也是如此, 对根结点判断后, 再对其根节点的子结点进行判断处理. 同样也是有递归和非递归两种方式来解决. 递归的方法 : class Solution { public boolean isSymmetric(TreeNode root) { if (root == null) ...

Leetcode101. Symmetric Tree

magic_jiayu的博客

02-12

174

Leetcode101. Symmetric Tree Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ ...

java-leetcode-101-symmetric-tree

08-13

java java_leetcode-101-symmetric-tree

leetcode 101: Symmetric Tree

永远不要给自己找借口

10-24

299

解题思路：先比较根节点的左子节点和右子节点，然后递归判断，左子节点的左子树与右子节点的右子树，左子节点的右子树与右子节点的左子树原题目：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,

leetcode 82. Remove Duplicates from Sorted List II

hui1140621618的博客

03-16

474

题目： Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 要求把链表中所有重复

leetcode 104. Maximum Depth of Binary Tree

hui1140621618的博客

03-17

390

题目： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 找到一棵二叉树的最大深度思路：采用递归的方法，分别找到

leetcode 110.Balanced Binary Tree

hui1140621618的博客

03-17

377

题目: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never

leetcode 136. Single Number

hui1140621618的博客

03-15

354

题目：Given an array of integers, every element appears twice except for one. Find that single one. 找到在数组中只出现过一次的数，要求线性时间，同时空间复杂度为O(1)。思路：将数组中的元素从小到大进行排列，然后比较相邻的元素，判断相邻的元素是否相等。实现代码：另

leetcode 100. Same Tree

hui1140621618的博客

03-16

290

题目： 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 83. Remove Duplicates from Sorted List

hui1140621618的博客

03-16

272

题目：Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3. 将所有重复的元素从有序的链表中删除

leetcode101—对称二叉树c语言