(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:
You are expected to follow the Stanford Honor Code.
If this is an assignment that allows pairs, the same rules apply to each team. For example, do not look at assignment solutions that do not belong to your team, and do not give your solution to anyone outside of your team.
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!