![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二叉树
路漫漫,远修兮
这个作者很懒,什么都没留下…
展开
-
LeetCode_144. Binary Tree Preorder Traversal_路漫漫远修兮
一、原题目Given a binary tree, return thepreordertraversal of its nodes' values.二、题目大意给定一个棵树,返回先序遍历结果。三、作者代码:作者一:#思路一 递归遍历class Solution: def preorderTraversal(self, root: TreeN...翻译 2019-04-22 18:56:12 · 112 阅读 · 0 评论 -
LeetCode_94. Binary Tree Inorder Traversal_路漫漫远修兮
一、原题目Given a binary tree, return theinordertraversal of its nodes' values二、题目大意给定一个棵树,返回中序遍历。三、作者代码:作者一:#思路一:递归算法class Solution: def inorderTraversal(self, root: TreeNode) ...翻译 2019-04-22 19:10:15 · 131 阅读 · 0 评论 -
LeetCode_145. Binary Tree Postorder Traversal_路漫漫远修兮
一、原题目Given a binary tree, return thepostordertraversal of its nodes' values.二、题目大意给定一个棵树,返回后序遍历。三、作者代码:作者一:#思路一:class Solution(object): def postorderTraversal(self, root):...翻译 2019-04-22 19:22:49 · 125 阅读 · 0 评论 -
LeetCode_102. Binary Tree Level Order Traversal_路漫漫远修兮
一、原题目Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).二、题目大意题目大意:给定一棵树,进行层次遍历三、作者代码:作者一:#思路一:class Solution(ob...翻译 2019-04-22 20:15:39 · 138 阅读 · 0 评论 -
LeetCode_101. Symmetric Tree_路漫漫远修兮
一、原题目Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).二、题目大意给定一个二叉树,判断是否为中心对称(镜像)三、思路分析别人的思路:主要思路还是分情况讨论,如果左右结点都为空,跳过当前循环;如果左右结点中只...原创 2019-04-23 21:46:10 · 132 阅读 · 0 评论 -
AgainUnderstand_144. Binary Tree Preorder Traversal_路漫漫远修兮
思路一:class Solution: def preorderTraversal(self, root: TreeNode) -> List[int]: stack=[] trav=root res=[] while trav or stack: if trav: ...原创 2019-04-24 20:11:20 · 177 阅读 · 0 评论 -
AgainUnderstand_94. Binary Tree Inorder Traversal_路漫漫远修兮
思路一:class Solution: def inorderTraversal(self, root: TreeNode) -> List[int]: res=[] self.centertrave(root,res) return res def centertrave(self,root,res): ...原创 2019-04-24 20:17:41 · 92 阅读 · 0 评论 -
AgainUnderstand_145. Binary Tree Postorder Traversal_路漫漫远修兮
思路一:#这个思路利用了:根右左的顺序遍历二叉树,反过来就是 左右根 即后序遍历了 class Solution(object): def postorderTraversal(self, root): stack, res = [], [] while stack or root: if root: ...原创 2019-04-24 20:25:16 · 140 阅读 · 0 评论 -
AgainUnderstand_102. Binary Tree Level Order Traversal_路漫漫远修兮
思路一:#这个思路还是很清楚的class Solution(object): def levelOrder(self, root): if not root:return [] stack,queue,res,nCount=[root],[],[[root.val]],1 while stack: temp=s...原创 2019-04-24 20:31:52 · 118 阅读 · 0 评论