**This is an old revision of the document!**


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 for Sections 3 and 4

  1. (3 points) 11.1.2
  2. (4 points) 11.1.4
  3. (2 points) 11.2.2
  4. (2 points) 11.2.4
  5. (4 points) 11.4.14
  6. (4 points) Repeat problem 11.4.14 only this time assign post-order traversal numbers to each vertex.
  7. (4 points) 11.4.16 (just the graph from problem 11.4.14)
  8. (2 points) 11.5.1
  9. (4 points) 11.5.2
  10. (6 points) 11.5.6
cs-236/homework-10.1424194561.txt.gz · Last modified: 2015/02/17 10:36 by egm
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0