94. Binary Tree Inorder Traversal
来源:互联网 发布:我国加工贸易知乎 编辑:程序博客网 时间:2024/06/05 16:51
题目:中序遍历二叉树
思路:递归
# Definition for a binary tree node.
class TreeNode(object):
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution(object):
def inorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
l = []
return self._inorderTraversal(root,l)
def _inorderTraversal(self,root,l):
if root==None:return []
self._inorderTraversal(root.left,l)
l.append(root.val)
self._inorderTraversal(root.right,l)
return l
0 0
- 94. Binary Tree Inorder Traversal
- 94.Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94.Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal
- linux 权限说明
- JAVA学习日志:static关键字
- 如何用代码在Excel中实现单元格内换行
- Jquery的loading插件
- LeetCode-303. Range Sum Query
- 94. Binary Tree Inorder Traversal
- 仿饿了么加入购物车旋转控件
- Android Studio使用Ctrl+鼠标滚轮调整字体大小
- ecshop开发环境搭建
- MVC个人理解
- 获取系统日期
- [51NOD] 1004 n^n的末位数字 [数学]
- 简单理解时间复杂度怎么计算?
- Sql Server数据库自增长字段标识列的插入或更新修改操作办法