BIG O of Binary Search Trees
Sep 19, 2021
The time complexity of binary search trees for search, insert and delete.
The average time for BST is O(log n) in which you can see that log n is very good which is a great time for the search and insert considering it is a constant time. It will take a very long time for it to grow.
It will only work if the BST is properly organized.
Therefore it always much better to pick a root node that is almost in the middle.
