CS 24 Plan for Today:

Complete binary trees (cont.)
	[chapt10a.ppsx]
	Array representation: commonly root at a[0]
		left, right children at a[1], a[2]
		a[i]:	parent of a[2i+1], a[2i+2]
			child of a[(i-1)/2]
		What if root at a[1] instead?

Binary tree nodes [bintree.h, .template]
	Implementing tree_clear, tree_copy, ...

Sample application - guessing game [animal.cxx]

Start binary search trees [chapt10b.ppsx]