class Node(object):
def __init__(self, v):
self.value = v
self.left = None
self.right = None
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)
def inorder(root):
current = root
stack = []
while True:
if current:
stack.append(current)
current = current.left
elif stack:
current = stack.pop()
print(current.value, end=' ')
current = current.right
else:
break
def preorder(root):
current = root
stack = []
while True:
if current:
stack.append(current)
print(current.value, end=' ')
current = current.left
elif stack:
current = stack.pop()
current = current.right
else:
break
def postorder(root):
current = root
stack = []
prev = None
while True:
if current:
stack.append(current)
current = current.left
elif stack:
current = stack[len(stack) - 1]
if current.right is None or current.right == prev:
print(current.value, end=' ')
stack.pop()
prev = current
current = None
else:
current = current.right
else:
break
print(
r'''
1
/ \
2 3
/ \
4 5
'''
)
print('\n--------- Pre Order ---------------')
preorder(root)
print('\n--------- In Order ---------------')
inorder(root)
print('\n----------Post Order -------------')
postorder(root)
非递归遍历二叉树
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门，熙熙楼的掌柜王于贵愁眉苦脸地迎上来，“玉大人，你说我怎么就摊上这事。” “怎么了？”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着，像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上，一...
- 文/苍兰香墨 我猛地睁开眼，长吁一口气：“原来是场噩梦啊……” “哼！你这毒妇竟也来了？” 一声冷哼从身侧响起，我...
推荐阅读更多精彩内容
- 注：本文来自 左程云的书《程序员代码面试指南》 题目：分别用递归和非递归方法，实现二叉树的先序遍历(根左右)、中序...
- 方法一：递归遍历 方法二：非递归遍历算法思想：使用栈。 内层循环用来存储节点，外层循环将内层循环的存储不断地转至节...
