Objectives
Properties of trees and rooted trees
Build, search, and traverse binary search trees.
Perform in-order, pre-order, and post-order traversal on trees and graphs
Compute the depth-first and breadth-first search for a graph
Find minimum spanning trees using Kruskals and Prim's algorithms
Compute the strongly connected components in a graph
Problems
(3 points) 11.1.2
(4 points) 11.1.4
(2 points) 11.2.2
(2 points) 11.2.4
(4 points) 11.4.14
(4 points) Repeat problem 11.4.14 only this time assign post-order traversal numbers to each vertex of the spanning tree.
(4 points) 11.4.16 (just the graph from problem 11.4.14)
(2 points) 11.5.1
(4 points) 11.5.2
(6 points) 11.5.6
Back to top
search
