Day 17: mat385

Today:

• Next time: Homework 5.1 is due

• Homework 5.2 will be due next Wednesday

• Section 5.2 (pdf): Trees and their representations

• An application: Section 5.3 (pdf): Decision trees

Links:

• Graph Theory Tutorials (thanks George!)
• Good on-line intro to graph theory (thanks George!) (note, however, that trees are defined without a root).
• Tree-traversal animation
• Reverse Polish Notation
• NIST (the National Institute of Standards and Technology) defines it as "A connected, undirected, acyclic graph" (and "rooted"). Our book does not require the "undirected" part, and many sources assume that a tree is directed! This does, unfortunately, add to the confusion.... An ordered tree is one where the children are numbered (there is a left to right), which is important for tree traversal.
• Identification of Common Trees of Iowa.

• NIST (the National Institute of Standards and Technology) Dictionary of Algorithms and Data Structures