Algorithms and Data Structures (INF1, Autumn'05)
Lecture 8
Main topic: Trees.
Lecture Plan
- definition and basic properties
- rooted trees
- binary trees, balanced binary trees
- ADT Binary Tree
- Tree traversal - preorder, inorder, postorder
Reading
-
Sections 6.1, 6.2 and 6.3
of Algorithms and Data Structures: Design, Correctness and Analysis
by Jeffrey H. Kingston.
- Have a look at
this graphical demonstration of preorder, inorder
and postorder tree traversals.