Reading 11: Binary Search Trees

Everyone:

Next week, we will continue to build on our discussion of binary trees and explore binary search trees and their self-balancing variants: treaps and red-black trees.

TL;DR

The focus of this reading is binary search trees, treaps, and [red-black-trees].

Readings

The readings for this week are:

  1. Data Structures Handbook

  2. Learn DS & Algorithms

  3. Open Data Structures

Quiz

Once you have completed the readings, answer the following Reading 11 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 reading11           # Create reading11 branch and check it out

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

$ ../.scripts/check.py                # Check reading11 quiz
Checking reading11 quiz ...
      Q1 0.40
      Q2 0.80
      Q3 0.50
      Q4 0.20
      Q5 0.20
      Q6 0.20
      Q7 0.70
   Score 3.00 / 3.00
  Status Success

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

$ git push -u origin reading11        # 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 11 TA List.