Given the Tollowing binary search tree, a. If you insert a new key g, where should g be? b. If you need to remove f, what is the successor for f? c. What is the depth of node c? For the toolbar press ALT+F10./POLOr ALT+EN+F10 (Mac), QUESTION 5 What is special about the inorder traversal of a binary search tree? O It traverses in a non-increasing order O It traverses in an increasing order It traverses in a random fashion O It traverses based on priority of the node