#bst

Binary Search Trees: Ordered in O(log n)

How the BST rule (left < node < right) gives O(log n) search, why inorder traversal comes out sorted, and the skewed worst case, with a live tree visualizer.