Which of the following statements are TRUE regarding BSTs and AVL trees?

$1$ point

BST and AVL$-$tree are both meant for implementing dictionary ADTs.

The worst$-$case height of a BST is O$($n$),$ whereas the worst$-$case height of an AVL tree is O$($log n$).$

The search is more efficient in BST than in the AVL tree.

The nodes and sub$-$trees of AVL tree rotate on insertion to maintain height balancing, which is not the case with BST$.$