資料結構›Ch5 樹狀結構
第 43 題/共 48 題
◀ DS 43/48
43. Binary Search Tree、Preorder Traversal、Tree Level
#DS-05-043易Binary Search TreePreorder TraversalTree Level

(10%) Please show the level of the binary search tree which constructed from given preorder traversal. The preorder traversal: 50, 15, 11, 3, 2, 22, 84, 80, 77, 90, 95.

Note: In a tree, each step from top to bottom is called as level of a tree. The level count starts with 1 and increments by 1 at each level or step.

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