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

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

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

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

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