please I need it urgent thank in c++

5. Binary search trees: (a) Draw the binary search tree that results from inserting (in order) each of the elements in the array 6 9 14 2 17 5 3 13] (b) What is the order in which nodes are visited by a pre-order traversal? (c) Is this a complete binary tree? (d) If 6 is erased, what node will replace it