Next week, we will work on problems related to trees and in particular binary trees, heaps, and binary search trees. Understanding how to represent, manipulate, and operating on these data structures will be necessary to solve Challenge 13 and Challenge 14.


The readings for this week are:

  1. Competitive Programmer's Handbook

    • Chapter 14 - Tree Algorithms

    • Chapter 18 - Tree Queries

  2. Open Data Structures


Once you have done the readings, answer the following Reading 07 Quiz questions:


To submit you work, follow the same process outlined in Reading 00:

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

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

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

$ ../.scripts/submit.py               # Check reading07 quiz
Submitting reading07 assignment ...
Submitting reading07 quiz ...
      Q1 0.70
      Q2 0.40
      Q3 0.30
      Q4 0.30
      Q5 0.30
   Score 2.00

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

$ git push -u origin reading07        # Push branch to GitLab

Remember to create a merge request and assign the appropriate TA from the Reading 07 TA List.