Lecture 8.



Continuing with our study of binary trees we saw two inductive arguments based on the recursive definition of a binary.
I then gave a generic template for non-recursive algorithms to do binary tree traversals. This was done not to diminish the importance of the recursive tree traversal algorithms. but rather to support the recursive algorithms. Working through some examples where you see how subproblems are stacked should give you deeper insight on how the recursive algorithms work. Furthermore, I think that all would agree that the recursion provides a much tidier solution.
We ended with a look at level order traversals using a queue.

This ends our classroom treatment of binary trees.

At the beginning of class I made an important announcement regarding new quiz dates. The "offical" announcement is in the announcement section of our bulletin board on WebCT. A copy can also be found in the announcement category of this Blog.

I will be away for the next four lectures. That is, Lectures 9,10, 11, 12. Chris McAloney will cover those classes in my place. Stay tuned for the next Blog enrty on Feb. 7.

Posted: Wed - January 26, 2005 at 02:52 PM        

©