Binary Search Tree is fast in insertion and deletion etc. when balanced.

Very efficient and its

code is easier than other data structures. Stores keys in the nodes in a way that searching,
insertion and deletion can be done efficiently
The maximum number of required by any BST operations is the number of nodes along the
longest path from root to a leaf, which is the tree’s height .the order in which insertion and
deletion operation are performed on BST affects its height.

Insertion and deletion are average case is O (log n) but worst case O (n). But traversal operation
is both cases O (n).

 The binary search tree is a balanced binary search tree.

 Height of the binary search tree becomes log (n).
 So, Time complexity of BST Operations = O (logn).
So balanced tree and AVL tree to increase the retrieval efficiency f BST.

https://www.youtube.com/watch?v=bgM8A6bNhRc