0

construct a binary tree from post-order and in-order traversal sequences

Post-order: D G E B H I F C A

In-order: D B G E A C H F I

Asked question