January 2019
Intermediate to advanced
316 pages
8h 8m
English
Content preview from Hands-On Data Structures and Algorithms with Rust
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Upsides
Compact and low-complexity implementation make the binary heap a great candidate for requiring any kind of sorting data structure. Other benefits include the following:
- An efficient way to sort lists
- Works well in concurrent situations
- A very efficient way to store a sorted array
Yet there are also downsides.