Everyone:
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, Challenge 14, and Challenge 15.
The readings for this week are:
Competitive Programmer's Handbook
Chapter 14 - Tree Algorithms
Chapter 18 - Tree Queries
Once you have done the readings, answer the following Reading 05 Quiz questions:
To submit you 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 reading05 # Create reading05 branch and check it out
$ cd reading05 # Go into reading05 folder
$ $EDITOR answers.json # Edit your answers.json file
$ ../.scripts/check.py # Check reading05 quiz
Checking reading05 quiz ...
Q1 1.40
Q2 0.80
Q3 0.60
Q4 0.60
Q5 0.60
Score 4.00 / 4.00
Status Success
$ git add answers.json # Add answers.json to staging area
$ git commit -m "Reading 05: Done" # Commit work
$ git push -u origin reading05 # Push branch to github
Once you have commited your work and pushed it to GitHub, remember to create a pull request and assign it to the teaching assistant.