Construct a tree given its in-order and post-order traversal strings. in-order: 1 2 3 4 5 6

Question:

Construct a tree given its in-order and post-order traversal strings.


  • in-order: 1 2 3 4 5 6 7 8 9 10 
  • post-order: 1 3 2 5 4 7 10 9 8 6
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: