Practice
Learn
← Quit
0 / 0 correct
Rust
Hard
1 of 40
Why does Rust's BTreeMap use a B-tree instead of a red-black tree?
A
B-trees don't need comparisons
B
Many keys per node (up to 11) means fewer allocations and better cache locality
C
B-trees use less code
D
Red-black trees can't be implemented in Rust