Lesson 08

(Please ignore this - these are notes for myself for the next iteration of this course)

Feedback / Improvements on exericses:
(Please ignore this - these are notes for myself for the next iteration of this course)
SOME PEOPLE DIDN"T HAND IN THE LESSON 08 Viewing QUIZZES BECAUSE OF A NOTE ABOUT NOT NEEDING TO RE-DO ONE PART, ABOVE

IDEA: Provide code to hard-wire a BST, then make them do the searching routine?  Video with iterative & recursive approach?  Variation: Hardcode a bunch of duplicates, make them modify search to find dups?

PCES:
  1. BST: Print  (coded in C#, using recursion) (Hand-In)
    Video: BST: Print
    Feedback: Broaden scope - try pre/in/post order traversal?
  2. BST: Recursive Add (Hand-In)
    Video: Recursive Add
    Feedback: Should duplicates cause problems, or not?