Outline:

1. Questions?
2. Recap: toString() for a recursive queue
3. Debugging recursion
4. Tree ADT
5. Tree traversals
6. Wrap-up

What’s next

• Quiz 6 will be next Monday and cover the following Quiz Learning Objectives:

  • Core:
    • RC 1: defining recursion
    • TR 1: tree traversal
  • Advanced:
    • RC 2: using recursion
  • Repeats from before (not guaranteed, but likely):
    • SQ 3: queues (CR)
    • SQ 4: core queue time complexity (CR)
    • KF 6: nested loops (AD)
    • OO 2: interfaces (AD)
    • SQ 6: queue time complexity (AD)

• Assignments 3 and 4 will be finalized Monday at 10pm – try to do it by Sunday night, though!

• Assignment 5 is due tonight

• Assignment 6 will be released today

What you should do now:

• The readings (see below)
• Resubmit Assignment 3 and Assignment 4
• Complete Assignment 5
• Read the writeup and starter code for Assignment 6 to get an idea of what you’ll be doing

Reading assignment (to be completed by the next class):

Recursion (from today):

• Recursion, again
• Trees
• Tree traversal

Binary [search] trees (for next time):

• Binary search trees