Binary search tree over AVL tree

Question

As far as I know the time complexity between AVL trees and Binary Search Trees are the same in average case, with AVLs beating BSTs in worst case scenarios. This gives me a

Answer 1

My assumption is: when you mention BST, you mean a BST without balancing.

It could be argued that if you need a navigatable data structure and you know your data won't be worst case (sorted) and is somewhat small, a BST (without balance) would be adequate.

But more than likely that's a rare case.