二叉树先序非递归

stack = []
stack.append(root)
while len(stack) > 0:
    p = stack.pop()
    if p.right:
        stack.append(p.right)

    if p.left:
        stack.append(p.left)