CprE 310, Practice Problems on Graphs (First set), Fall 2002

Date: 12/09/02

NOTE: These are meant to cover material on Graphs and Trees which was
not covered by the homeworks. Though you will not have to submit your
solutions to us, they will help you in preparing for the exam.

1) Binary Search Trees, etc:

  - Problems 5 and 6, page 546
 

2)Tree Traversals:

  - Problems 7,10 and 13, pages 560 and 561

  - Problems 26 and 29, page 561

  - Construct a binary tree whose preorder traversal yields C,B,E,D,A 
    and whose inorder traversal yields B,E,C,A,D

  - Construct a binary tree with 7 vertices whose preorder traversal is the
    same as its inorder traversal (there should be at least two distinct
    node labels in the tree).

3) Graph Representation:

  - Problems 13 and 14, page 464. Draw the corresponding adjacency lists too.

  - Problems 17, 28 and 29, pages 464-465

  - Problems 57 (a) and (b), page 466

  - Problem 69, page 467

  - A graph has n vertices, each with degree at least two. What is the minimum
    number of edges it can have? Prove why your answer is the minimum possible.