Which of the following is a disadvantage of using a binary search tree $($BST$)?$

a$.$ It cannot be used to implement priority queues

Ob$.$ It may become unbalanced leading to worst$-$case time complexity of O

Oc It has a time complexity of O$(1)$ for searching

Od$.$ It requires more space compared to other data structures