Reading 10: Binary Heaps, Priority Queues

Everyone:

Next week, we will build on our discussion of binary trees and explore binary heaps, which are typically use to construct priority queues.

TL;DR

The focus of this reading is binary heaps and priority queues.

Readings

The readings for this week are:

  1. Data Structures Handbook

  2. Learn DS & Algorithms

  3. heapq

Quiz

Once you have completed the readings, answer the following Reading 10 Quiz questions:

Submission

To submit your work, follow the same process outlined in Reading 01:

$ git checkout master                 # Make sure we are in master branch
$ git pull --rebase                   # Make sure we are up-to-date with GitHub

$ git checkout -b reading10           # Create reading10 branch and check it out

$ cd reading10                        # Go into reading10 folder
$ $EDITOR answers.json                # Edit your answers.json file

$ ../.scripts/check.py                # Check reading10 quiz
Checking reading10 quiz ...
      Q1 0.30
      Q2 0.50
      Q3 0.20
      Q4 1.00
      Q5 0.20
      Q6 0.20
      Q7 0.20
      Q8 0.40
   Score 3.00 / 3.00
  Status Success

$ git add answers.json                # Add answers.json to staging area
$ git commit -m "Reading 10: Done"    # Commit work

$ git push -u origin reading10        # Push branch to GitHub

Pull Request

Once you have committed your work and pushed it to GitHub, remember to create a pull request and assign it to the appropriate teaching assistant from the Reading 10 TA List.