Construct a tree fiven its in-order and pre-order traversal strings.

inorder: 1 2 3 4 5 6 7 8 9 10

pre-order: 6 4 2 1 3 5 8 7 9 10

• Where you able to accomplish the above task? If no, which one(s) did you struggle with and what did you do to seek out help?
• What did you find most challenging in this exercise?
• Submit a screen shot of your source code and exercise running

PICTURES OF SOURCE CODE IS NEEDED!!! Marks are allocated not just for running code but for your understanding and explanation of the performance of algorithms.