Reconstructing the tree from its traversals:

It is possible to reconstruct $($meaning$,$ draw$)$ the binary tree given only

the tree$$s pre$-$order and in$-$order traversals. To illustrate this, draw the

binary tree by reconstructing it from the following traversals:

$$ Pre$-$order : C$,$ B$,$ A$,$ I, K$,$ L$,$ M$,$ J$,$ D$,$ H$,$ E$,$ G$,$ F

$$ In$-$order: A$,$ B$,$ L$,$ K$,$ M$,$ I, J$,$ C$,$ H$,$ D$,$ G$,$ E$,$ F

Note: You must draw a single binary tree that works for both traversals.