Let us consider the following binary tree, called T $.$

Select one or more:

a$.$ If $A=30,B=20$ and $C=14,$ then $T$ is a Min$-$Max heap

b$.$ If $A=20,B=30$ and $C=14,$ then $T$ is a Min$-$Max heap

c$.$ If $A=20,B=30$ and $C=14,$ then $T$ is a binary search tree

d$.$ If $A=30,B=20$ and $C=14,$ then $T$ is a binary search tree