tree_structure

Algorithms exercise comparing binary search trees: builds a degenerate BST and a balanced tree (binary halving of a sorted list), then benchmarks min/max search, keyed deletion, in-order/pre-order traversal, full post-order teardown, and DSW rebalancing — all timed in microseconds.

Building

cmake -B build && cmake --build build
./build/tree