Midterm Exam 2 Review:
Higher Order Procedures, Data Abstraction, Lists, and Binary Trees

• Higher-Order Procedures
• Exercise 5.9, p. 120
• Exercise 5.17, p. 123
• Exercise 7.39, p. 204
• Exercise 7.8a, p. 174
• Exercise 7.8b, p. 174
• Binary Trees and Binary Search Trees
• Binary Tree Traversals
• Binary Tree Properties
• Exercise 8.8, p. 222