資料結構›Ch5 樹狀結構
第 11 題/共 48 題
◀ DS 11/48
11. Post-order Traversal、Binary Tree
#DS-05-011易Post-order TraversalBinary Tree

(是非題)If we perform the post-order traversal from the root of a tree and mark the visited nodes with ascending numbers, then the root will have the largest number.

📄 台大112
跳轉到第題
▤完整推導請見《WH 資工筆記 · 資料結構》Ch5 樹狀結構
本章題號 · 1–20 / 48