What is the best$-$case time complexity for deleting a node from a Binary Search Tree $($BST$)?$ You can assume there are n nodes in the BST$.$

Question $2$Answer

a$.$

O$($n$)$ when the tree is unbalanced

b$.$

O$($logn$)$ when the tree is balanced

c$.$

O$(1)$

d$.$

O$($nlogn$)$ when the tree is unbalanced