Trees, tree traversal, spanning trees, minimum spanning trees, Huffman encoding, Prim’s and Kruskal’s algorithms, applications to network routing.
Sections 11.1-11.5: Trees, applications, traversal, spanning trees, minimum spanning trees
Textbook 58 pages
Trees, rooted trees.
Lecture notes
Applications, tree data structures, hierarchical structures, decision trees, game trees, Huffman trees.
Tree traversals, notations of expressions
Spanning trees, DFS Trees, BFS Trees, minimum spanning trees, Kruskal’s algorithm, Prim’s algorithm.
Identifying trees, roots, leaves, vertices, edges (Rosen Section 11.1).
Problems
Solutions
Binary search trees, Huffman coding (Rosen Section 11.2).
Universal address system, preorder, inorder, postorder traversal, prefix, postfix, infix notation (Rosen Section 11.3).
Spanning trees, depth-first and breadth-first search (Rosen Section 11.4).
Prim’s algorithm, Kruskal’s algorithm (Rosen Section 11.5).