def pre_order(root):
"""
前序: 根 左 右
stack:
入栈顺序: 右 左
出栈顺序: 左 右
"""
if not root:
return []
stack = []
res = []
stack.append(root)
while stack:
root = stack.pop()
res.append(root.val)
if root.right:
stack.append(root.right)
if root.left:
stack.append(root.left)
return res
def in_order(root):
"""
中序: 左 根 右
stack
root
不断压入左
没有左了 弹出一个根 看有没右节点 接着不断压入右节点的左
"""
if not root:
return []
stack = []
res = []
while stack or root:
if root:
stack.append(root)
root = root.left
else:
root = stack.pop()
res.append(root.val)
root = root.right
def post_order(root):
"""
后序: 左 右 根
stack
root
stack:
压一个根 并 将其添加到res的队首 且 不断压入右
出一个 看左
"""
if not root:
return []
stack = []
res = []
while stack or root:
if root:
stack.append(root)
res.insert(0, root.val)
root = root.right
else:
root = stack.pop()
root = root.left
return res
def post_order(root):
if not root:
return []
stack = []
res = []
stack.append(root)
while stack:
root = stack.pop()
if root.left:
stack.append(root.left)
if root.right:
stack.append(root.right)
res.insert(0, root.val)
return res
二叉树非递归遍历
最新推荐文章于 2023-02-15 12:59:49 发布