Let us consider a Binary Search Tree, BST, with N elements and with height H.

Select all that apply:

a. Delete of a one child node is in O(log N) if BST respects the AVL property

b. Printing BST using the pre order, the post order or the in order traversal is in O(H) if the tree is degenerated (each node has at most 1 child).

c. N = 2^H if BST is a perfect balanced tree (each non leaf node has exactly 2 children)

d. N = H if the BST is degenerated (each node has at most 1 child).

e. Delete of a leaf node is in O(log N) if the tree is degenerated (each node has at most 1 child).

f. Printing BST using the post order traversal is in O(H) if BST respects the AVL property