Which of the following statements are CORRECT about binary search trees?

The predecessor of a node must be its left child.

The successor of a node, if it exists, must be the tree minimum of the node's right subtree.

Finding the tree maximum of the binary tree with n nodes takes Theta$($log n$)$ time.

Question $2$Select one:

I only.

II only.

I and III.

None of the listed answers is correct.

II and III.

III only.

I and II$.$

I, II and III.