# 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]
"""
res=[]
stk=[]
if root == None:
return res
while root != None or len(stk) != 0:
if root != None:
stk.append(root)
root=root.left
elif len(stk) != 0:
tmpNode=stk.pop()
res.append(tmpNode.val)
root=tmpNode.right
return res
相关文章
- [LeetCode] Binary Tree Level Order Traversal II 二叉树层序遍历之二
- [LeetCode] Closest Leaf in a Binary Tree 二叉树中最近的叶结点
- Java for LeetCode 145 Binary Tree Postorder Traversal
- Binary Tree Paths leetcode
- [LeetCode] Diameter of Binary Tree 二叉树的直径
- LeetCode题解之 Convert Sorted Array to Binary Search Tree
- 【LeetCode OJ】Convert Sorted Array to Binary Search Tree
- LeetCode OJ:Convert Sorted Array to Binary Search Tree(将排序好的数组转换成二叉搜索树)
- Leetcode No.108 Convert Sorted Array to Binary Search Tree(c++实现)
- 【一天一道LeetCode】#108. Convert Sorted Array to Binary Search Tree