I really liked reading this, but if I am not mistaken the worst time complexity of BST for insertion, deletion and searching is O(n) and not O(log n).
O(n)
O(log n)
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
I really liked reading this, but if I am not mistaken the worst time complexity of BST for insertion, deletion and searching is
O(n)and notO(log n).