資料結構›Ch5 樹狀結構第 39 題/共 48 題
39. Binary Tree、Traversal 重建、Level
#DS-05-039易Binary TreeTraversal 重建Level
[3%] A binary tree stores distinct keys. Based on the following postorder and inorder sequences, please list the keys of nodes at level 3 of the tree from left to right. Note that the root is at level 1.
- Postorder sequence: A B C K D I G J H F E
- Inorder sequence: A C B D K E I G F H J
Answer format: key1, key2, …
📄 成大115
▤完整推導請見《WH 資工筆記 · 資料結構》Ch5 樹狀結構