HashMap — unordered, O(1). BTreeMap — sorted, O(log n).
HashMap:
BTreeMap:
1use std::collections::{HashMap, BTreeMap};23let mut hash = HashMap::new();4hash.insert(3, "c");5hash.insert(1, "a");67let mut btree = BTreeMap::new();8btree.insert(3, "c");9btree.insert(1, "a");10// BTreeMap iterates in order: (1, "a"), (3, "c")
Key: HashMap for fast lookup, BTreeMap for sorted data.