兩種遍歷方式

廣度優先遍歷和深度優先遍歷，都可用遞歸和非遞歸實現

定義二叉樹

class Node:def __init__(self, root):self.root = rootself.left = Noneself.right = None

遞歸

# depth-first-traversal# pre-order def pre_order(tree):print(tree.root)pre_order(tree.left)pre_order(tree.right) # mid-order def mid-order(tree):mid-order(tree.left)print(tree.root)mid-order(tree.right) # post-order def post_order(tree):post_order(tree.left)post_order(tree.right)print(tree.root)# breadth-first-traversal

非遞歸

# depth-first-traversal# pre-order def pre_order(tree):stack = [tree]while stack:print(tree.val)if tree.right:stack.append(tree.right)if tree.left:stack.append(tree.left)tree = stack.pop() # mid-order# post-order# breadth-first-traversal def bft(tree):stack = [tree]while stack:t = stack.pop()if isinstance(t, Node):if t.right:stack.append(t.right)if t.left:stack.append(t.left)stack.append(t.val)else:print(t)

leetcode原題：leetcode 層次遍歷

ref

ref1

總結

以上是生活随笔為你收集整理的【数据结构与算法】二叉树遍历的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。