Binary tree ordered non-recursive

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)
Published 141 original articles · Like 54 · Visits 150,000+

Guess you like

Origin blog.csdn.net/iamjingong/article/details/105668909