2 Improving priority queues: d-way heaps
This chapter covers
- Solving the problem of serving tasks based on priority
- Using priority queues to solve our problem
- Implementing a priority queue with a heap
- Introducing and analyzing d-way heaps
- Recognizing use cases where heaps improve performance
In the previous chapter we introduced some basic concepts about data structures and programming techniques, described the structure of this book, and hopefully raised your interest. You should now be aware of why developers need to know about data structures.
In this chapter, we will further develop those ideas and refine our narration. This chapter is meant to be a soft introduction to what is presented in this book; we have chosen a topic that should ...
Get Advanced Algorithms and Data Structures now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
