题目
非递归中序遍历
代码
# 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]
"""
p = root
stack = []
res = []
while p!=None or len(stack)>0:
while p != None:
stack.append(p)
p = p.left
p = stack.pop()
res.append(p.val)
p = p.right
return res
