#bst

Binary Search Trees:Ordered Trees That Go Lopsided Under Sorted Input

A BST keeps left < node < right so search is O(height). Why already-sorted inserts become a linked list, and what that does to the bill.

Read More →