Assignment Task Given an inOrder traversal and preOrder traversal Or inOrder traversal and postOrder traversal How to construct the original binary tree? Please make sure that your assignment answers both of the cases (i.e the procedures for both case 1 and 2 should be described with examples)