Let T be a binary search tree (BST) with n distinct keys. Select all the statements below which are TRUE: In TREE-DELETE (T, z), if z has 2 children then z is replaced by its successor. In the INORDER-TREE-WALK (x), the keys are printed in monotonically decreasing order. For a balanced BST (all leaves have the same depth) with n nodes, the height is h = Theta (n). In TRANSPLANT (T, u, v), u's parent becomes v's parent the successor of a node x is the node with the smallest key greater than x. key. In the TREE-INSERT (T, z), the node is always inserted as a child of the minimum key node