Ordered Map (Binary Search Tree)

Build an ordered map on an unbalanced binary search tree: insert and look up integer keys, walk them in sorted order, find the smallest and largest, delete any node, and answer range queries for all keys between two bounds.