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%)