. DATA STRUCTURES. C LANGUAGE. STEP-BY-STEP.

Question * Q.6. (Marks:20) The in-order and post-order traversal of a binary tree are T, Q,S, D, E, A, M CF, R, X, P and T, S, Q, A, E, D, P, M,X, C, RF, respectively. Find the height of first node and depth of the last node and pre-order traversal of the above binary tree. Please do not write direct answer, draw tree and then find all the parameters asked