Suppose the following list of numbers is inserted in order into an empty binary search tree: 45, 32,

Suppose the following list of numbers is inserted in order into an empty binary search tree: 45, 32, 90, 34, 68, 72, 15, 24, 30, 66, 11, 50, 10 (i) Construct the binary search tree. (ii) Find the in-order, pre-order and post-order traversal of BST created. (9) b. Consider a polynomial p(x, y, z) as p(x, y, z) = 8×2 y 2 z – 6yz8 + 3×3 yz + 2xy7 z – 5×2 y 3 – 4xy7 z 3 (i) Rewrite the polynomial so that the terms are ordered. (ii) Suppose the terms are stored in the order shown in the problem statement in the linear arrays COEF, XEXP, YEXP, and ZEXP, with the HEAD node first. Assign values to LINK so that the linked list contains the ordered sequence of terms