What is the time complexity of binary search tree?

Best case O(log n). Average case O(log n). Worst case O(n). Space complexity is O(n). Everything is O(h), and h is only log n if the tree stays balanced.

Binary search tree

medium

One comparison discards an entire subtree - binary search expressed in pointers. Then insert sorted keys and watch it degenerate into a linked list, which is why balanced trees exist.

Best O(log n)Average O(log n)Worst O(n)Space O(n)

Loading the binary search tree engine…

Where to go next

AVL tree

hard

Four rotation cases that refuse to let the tree lean.

Tree traversals

easy

Pre, in, post and level order - recursive and iterative.

Binary search

easy

Halve the search space with every comparison.