The first round was an online interview. The question is as follows, All the leaves in a BST are removed iteration by iteration until the BST becomes empty. These leaves are stored in an array and are given as input. We are supposted to give the preorder travesal the Original BST. The input some what looked as follows, { B, D, H, P, Y, C, M, G, Q, K } Simpler solution would be to just constuct BST by supplying the inputs in reverse that is from K to B. And then do a preorder traversal. But I tried to do this with out constructing the BST and wasted a lots of time and hene failed.
