Which std::collections data structure is not discussed here?
BinaryHeap (https://doc.rust-lang.org/std/collections/struct.BinaryHeap.html).
How does Vec<T> or VecDeque<T> grow, as of 2018?
They double (or more) their size when more space is required.
Is LinkedList<T> a good default data structure?
No. It doesn't provide index access and is generally slower than Vec<T>, thanks to the internal memory structure, but provides the same basic features.
What hashing implementation does the 2018 HashMap<T> use by default?
SipHashing. There are others that are on their way into the standard library, such as the hashbrown crate (https://github.com/Amanieu/hashbrown).
What are three benefits of BTreeMap<T> over HashMap<T>?
Use any three, but here are some suggestions:
- Ordered keys
- Lower computational intensity (no hashing required...
