CS 24 Plan for Today:

Review Exam 2

Thinking recursively
	Main/Savitch moving_car [chapt09.ppsx]

More recursive algorithms:
	Binary number string [binarystring.cpp]
	Towers of Hanoi [hanoi.cpp]
	8 queens recursively [8queens.jar, .txt]

General tree terms and concepts
	nodes and links, root, leaf, subtree, empty
	parent, child, sibling, ancestor, descendant
	depth of node, tree height (max node depth)

Binary trees
	each node has “left” and “right” subtrees
	full - exactly 2^k nodes at each depth k
		half+1 of all nodes are leaves
	complete - full except possibly leaf level
		all leaves as far left as possible
		[chapt10a.ppsx]

Start array representation (complete binary trees only)