Let us consider a Min$-$Max heap with $N$ elements.

Select one or more:

a$.$ The height of the tree can be $N$ or $logN$

b$.$ The largest element is always one of the leaf nodes

C$.$ AVL property is needed to prevent the tree from degenerating

d$.$ The root is the smallest element