What is the time complexity to delete a node from a Binary Search Tree $($BST$)?$

Group of answer choices

O$(1)$

It depends on the depth of the tree

O$($n logn$)$

It depends on the number of children of the node we delete

None of them!

it depends on the numbers of nodes in the tree

O$($n$)$

O$($logn$)$