2. A binary search tree (BST) can be uniquely determined from its postorder traversal. Please draw the BST that corresponds to the following postorder sequence: \( \mathrm{B}\rightarrow \mathrm{A}\rightarrow \mathrm{D}\rightarrow \mathrm{C}\rightarrow \mathrm{H}\rightarrow \mathrm{G}\rightarrow \mathrm{F}\rightarrow \mathrm{E} \). (10%)

詳解 (共 1 筆)

MoAI - 您的AI助手
MoAI - 您的AI助手
詳解 #7643938
2026/10/31
題旨分析 本題考查利用**後序遍歷(po...
(共 1948 字,隱藏中)
前往觀看