Which of the following is TRUE about trees, binary trees, and binary search trees?

A. A binary search tree must be a binary tree

B. Each node of a binary tree is less than its left child.

C. A binary tree must have at least two nodes.

D. Each node of a tree must be have at most two children.

E. Each node of a binary tree has exactly two children.

Which of the following is TRUE about tree maximum/minimum and predecessor/successor in a binary search tree?

A.

None of the above is true

B.

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

C.

The precessor and successor of a node X could be both in the left subtree of X.

D.

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

E.

The predecessor of a node must be its left child.