Optimal binary search trees in Rust: compare cubic dynamic programming with Knuth’s quadratic optimization using verified results, reproducible benchmarks, and SVG visualizations.
-
Updated
Sep 21, 2026 - Rust
Optimal binary search trees in Rust: compare cubic dynamic programming with Knuth’s quadratic optimization using verified results, reproducible benchmarks, and SVG visualizations.
To associate your repository with the interval-dp topic, visit your repo's landing page and select "manage topics."