Mark all statements that are true about Binary Search Tree $($BST$).$

Group of answer choices

Worst case running time for search in a BST of n items equals the worst case for searching in an array of n items using binary search.

Worst case when deleting an item in a BST is O$($n$)$

Best case search is O$($log n$)$

Sometimes a BST node can have more than $2$ children nodes

The smallest node is always a leaf node

The biggest node is always a leaf node