Skip to content

Glossary: Coding Interviews in Rust

BTreeMap

A Rust map that keeps its keys in sorted order, so a report comes out in name order without a separate sort. Lookups cost O(log n) instead of O(1).

Where the book teaches it

Related terms

Hash map lookup and counting