Let us consider a Binary Search Tree, BST$,$ of height $H.$ In terms of $H,$ the complexity in time

$($big$-$Oh notation$)$ of the BST operations is as follows.

Select one or more:

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

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

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

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

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

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