Looking for last year's course web site?
Click here for the CS 106X, Autumn 2015 course web site.
NOTE: This web site is out of date.
This is the course web site from a past quarter, Autumn 2016.
If you are a current student taking the course, this is not your class web site, and you should visit the current class web site instead at http://cs106x.stanford.edu/.
If you are already at http://cs106x.stanford.edu/, the web page may not be updated yet for the new quarter.
Please be advised that courses change with each new quarter and instructor.
Any information on this out-of-date page may not apply to you this quarter.
(Suggested book reading: Programming Abstractions in C++, Chapter 16, section 16.2)
Today we'll learn about a specific species of binary tree called a binary search tree.
or BST. All the usual rules and terminology about binary trees apply, with an
additional order property (constraint). For every node R:
every element of R's left subtree contains data less than R's data
every element of R's right subtree contains data greater than R's data
In your file's comment header, list both partners' names; also cite all sources of help, including books, web pages, friends, section leaders, etc.
Do not consult any assignment solutions that are not your (pair's) own.
Do not attempt to disguise any code that is not your (pair's) own.
Do not give out your assignment solution to another student (outside of your pair).
Do not post your homework solution code online. (e.g. PasteBin, DropBox, web forums).
Please take steps to ensure that your (pair's) work is not easily copied by others.
Remember that we run similarity-detection software over all solutions,
including this quarter and past quarters, as well as any solutions we find on the web.
If you need help solving an assignment, we are happy to help you.
You can go to the LaIR,
or the course message forum,
or email your section leader,
or visit the instructor / head TA during office hours.
You can do it!