Tree Implementations
CSC 220

Topic

• Vector implementation of a binary tree
• Pointer implementation, using dynamic memory, of any type of tree.
• Application: operator precedence parsing
• Pre-order, post-order, in-order
• Level-order transversal of trees, using a Queue
• Binary representation of any general tree

Readings

Continuation of the previous topic's reading:  Chapter 13, everything except 13.3.2.  This is an important chapter, with very common and important applications of trees described as examples (with the exception of the "Animal Guessing Game").

	Office:  M233a	Phone:  353-2250	sbadman@parkland.edu