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)
Binary tree ordered non-recursive
Guess you like
Origin blog.csdn.net/iamjingong/article/details/105668909
Recommended
Ranking