Deletion operation in Binary Search Tree has what time$-$complexity in the worst case?

a$.$

O$($N$)$

b$.$

O$($logN$)$

c$.$

O$(1)$

d$.$

None of the above

e$.$

O$($N$2)$