Let us consider the following binary tree, called T.

Select all that apply:

a. If A > B > C > 10, then T is a Min-Max heap

b. If B > A > C > 10, then T is a binary search tree

c. If A > B > C > 10, then T is a binary search tree

d. If B > A > C > 10, then T is a Min-Max heap