Let us consider a Binary Search Tree, BST$,$ with N elements and with height $\backslash ($ H $\backslash ).$

Select one or more:a$.$ Delete of a one child node is in $\backslash (\backslash$mathrm$\{$O$\}(\backslash$mathrm$\{$N$\})\backslash )$ if BST respects the AVL propertyb. $\backslash (\backslash$mathrm$\{$N$\}=\backslash$log $\backslash$mathrm$\{$H$\}\backslash )$ if the BST is degenerated $($each node has at most $1$ child$).$c$.\backslash ($ N$=$H$^\{2\}\backslash )$ if BST is a perfect balanced tree $($each non leaf node has exactly $2$ children$)$d$.$ Printing BST using the pre order, the post order or the in order traversal is in $\backslash (\backslash$mathrm$\{$O$\}\backslash$left$(2^\{\backslash$mathrm$\{$H$\})\}\backslash$right$.\backslash ))$ if BST is perfectly balanced $($each non leaf node has exactly $2$ children$)$e$.$ Printing BST using the post order traversal is in $\backslash (\backslash$mathrm$\{$O$\}(\backslash$log $\backslash$mathrm$\{$H$\})\backslash )$ if BST respects the AVL propertyf. Delete of a leaf node is in O$(1)$ if the tree is degenerated $($each node has at most $1$ child$).$