Let us consider a Binary Search Tree, BST$,$ of height $H.$ In terms of $H,$ the complexity in $($big$-$Oh notation$)$ of the BST operations is as follows.

Select one or more:

a$.$ FindMax is in $O(H)$

b$.$ Printing BST using the pre order traversal is in $O(log(logH))$

c$.$ Find Min is in $O(H^2)$

d$.$ Printing BST using the in order traversal is in $O(logH)$

e$.$ Delete of a leaf node is in $O(H)$

f$.$ Delete of a one child node is in $O(H)$