# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution94(object): ######二叉树中序遍历的非递归方法,用栈
def inorderTraversal(self, root): #先把根节点入栈,如果左子树一直不为空,就一直入栈,直到
##把所有左节点入栈,然后pop栈顶元素,指针指向栈顶元素的右子树
"""
:type root: TreeNode
:rtype: List[int]
"""
stack=[]
res=[]
if not root:
return []
while root or stack:
while root:
stack.append(root)
root=root.left
if stack:
a=stack.pop()
root=a.right
res.append(a.val)
return res