Review: Binary Trees

The last piece of this week's module is a review of binary trees and their properties.

This should all be material from CSC148, but most of us probably need a little refresher. We will also review a few definitions about trees in general.

If a quiz question uses some terminology that you don't remember (or never knew), leave the quiz and go review Appendix B in CLRS, your old CSC148/CSC111 notes (or any other source about trees) and then come back and take the quiz again. Be careful though when you use resources other than CLRS because different resources sometimes use different definitions for the same term.  We will use the definitions from CLRS.

Here are reminders of two specific definitions from CLRS that you will need.

The height of a tree is the length of the longest path from the root to a child.  (This might be different from the definition used in CSC148.)

The depth of a node in a tree is the length of the path from the root to that node.  This means that the depth of the root is 0 and the height of a tree consisting of a single node is 0.