(d) Most operations on a binary search tree have complexity that is proportional to the depth of the tree. Consequently, it is often advantageous to try to create a balanced tree whose depth is minimal. Building on the algorithm you described in (d)(i), propose an approach to convert an arbitrary binary search tree containing N nodes into a balanced binary search tree of depth O(log, N). [10%)