Which of the following is TRUE about tree maximum/minimum and predecessor/successor in a binary search tree?
A. The predecessor and successor of a node X could be both in the left subtree of x.
B. The successor of a node, if exists, must be the tree minimum of the the node's right subtree.
C. Finding the tree maximum of the binary tree with n nodes takes Theta( logn time.
D. None of the above is true
E. The predecessor of a node must be its left child.