Advanced Data Structures

Fall 2003


[ CIS 410/510 | CIS | UO | News ]


Assignment 5

Due Monday Nov. 10

  1. List operations on trees with cost that would result in the second tree of Figure 5.1(a).

  2. List operations on paths with cost that would implement the above.

  3. List all paths (and their successors) that implement the tree in Figure 5.2.

  4. Execute "by hand" expose(u) in the tree in Figure 5.2 (provide trace).

  5. Show the changes in the representation of the above tree that will be achieved by exposing vertex u, both pictorially and in the paths involved.