Introduces three new data structures
binary trees
trees
ordered trees
Shows
how to apply them to store data
that they are useful as conceptual aids to problem solving and uses them in the n-queens problem
how to implement them
Emphasizes the basic operations for
binary trees
preorder, inorder, and postorder traversals
trees
preorder and postorder traversals
backtracking
depth-first and breadth-first traversals
Clarifies the relation between recursion, trees, and stacks
Discusses recursive solutions to show
when they are efficient
how to improve them
7.3: Using the Traverse Functions for Binary Trees
7.4: Implementing Binary Trees
7.7: More on Recursion, Trees, and Stacks