Algorithms and OOD (CSC 207 2013F) : EBoards

CSC207.01 2013F, Class 45: Tree Traversal


Overview

Preliminaries

Admin

Questions on the Exam

Can you give us a different iterator for problem 1?

Done.

Do we need to explicitly free nodes?

No.

Did you really accidentally post the solution to problem 2?

Yes. Spend at least thirty minutes on it. Then look at my solution.
Then do something else interesting with the higher-order procedures. (That is, show interesting examples of their use.)

Suppose we put the elements in a binary tree into an array ...

Orders for traversing the tree

Copyright (c) 2013 Samuel A. Rebelsky.

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/3.0/ or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.