In addition to all concepts from Quiz 1, and Quiz 2

You should be able to define or explain the following terms:

• Trees and many related terms and properties, including nodes, the root node, leaf nodes, internal nodes, parent, child, path, depth of a node, subtree, height of a tree
• What it means to say a tree is a hierarchical structure.
• Compare and contrast linear data structures with trees
• Tree traversals: pre-order, in-order, post-order, and level-order traversals
• Binary tree
• Binary search trees and the BST property
• Dictionaries (generally, not related to hash tables)
• AVL trees and the AVL tree property
• Tree rotations
• The recursive definition of binary trees, binary search trees, and AVL trees
• Priority queue
• Analysis of priority queue implementations using sorted lists, unsorted lists, binary search trees, and binary heap trees
• Binary heap and the heap operations
• Complete binary trees and their array-based representation
• The heap-order property
• Sorting with a heap
• The conceptual overlaps and differences between trees, BST, AVL, priority queues, and heaps

You should be familiar with the following C++-related concepts:

• Iterators
• assert
• Command-line arguments
• Basic uses of file streams
• getline

Practice problems

1. For each data structure covered in the course, come up with a real-world application that motivates the data structure. The data structure should be able to provide a more efficient solution to the problem then any other structure covered so far.
2. Consider the following tree:
   
   1. What is the pre-order traversal of the tree?
   2. What is the in-order traversal of the tree?
   3. What is the post-order traversal of the tree?
   4. What is the level-order traversal of the tree?
   5. Identify if it is a tree, binary tree, BST, AVL tree, heap tree
   6. Based on your previous answer, draw the tree obtained by inserting 10 into the tree.
   7. Draw the tree obtained by deleting 2 from the tree.
   8. Draw both trees that might be obtained by deleting 4 from the tree while still maintaining the properties in your answer to e)
3. Consider a boolean function LinkedBst::containsInRange that takes as arguments two keys -- min and max -- and returns true if there exists a key k in the tree such that min <= k <= max. One possible implementation of this function is to call a recursive helper function that takes an additional argument -- a node in the tree, and returns whether that subtree contains any keys in the range:

     template <typename K, typename V>
     bool LinkedBst<K,V>::containsInRange(K min, K max) {
       return subtreeContainsInRange(root, min, max);
     }
   

   Write the recursive helper function subtreeContainsInRange. You may assume that empty trees are represented by pointer to a NULL node.
4. For each of the code fragments below, draw the AvlTree that results from the code fragment:

   1.   AvlTree<int,int> t;
        for (int i = 1; i <= 10; ++i) {
          t.insert(i,i);
        }
      

   2.   AvlTree<int,int> t;
        for (int i = 1; i <= 5; ++i) {
          t.insert(i,i);
          t.insert(-1*i,-1*i);
        }
      

   3.   AvlTree<int,int> t;
        for (int i = 1; i <= 5; ++i) {
          t.insert(i,i);
          t.insert(11-i,11-i);
        }
      

5. For each of the three code fragments above, draw the tree that would result if a LinkedBst were used instead of an AvlTree.
6. What is the worst-case running time of the following function? Use Big-O notation.

     void f(int n) {
       if (n < 0) {
         return;
       }
       AvlTree<int,int> t;
       for (int i = 0; i < n; ++i) {
         t.insert(i,i);
       }
       for (int i = 0; i < n; ++i) {
         cout << t.remove(i) << endl;
       }
     }
   

7. What is the smallest AVL tree such that removing a node requires a rotation to rebalance the tree? (There is more than one correct answer, but they're all the same size.)
8. What is the smallest AVL tree such that removing a node requires two rotations to rebalance the tree? (Again there is more than one correct answer, but they're all the same size.)
9. For each of the code fragments below, draw the BinaryHeap that results from the code fragment, and draw its final array-based representation:

   1.   BinaryHeap<int,int> heap;
        for (int i = 1; i <= 10; ++i) {
          heap.insert(i,i);
        }
        for (int i = 1; i <= 5; ++i) {
          heap.removeMin();
        }
      

   2.   BinaryHeap<int,int> heap;
        for (int i = 10; i > 0; --i) {
          heap.insert(i,i);
        }
      

   3.   BinaryHeap<int,int> heap;
        for (int i = 1; i <= 5; ++i) {
          heap.insert(i,i);
          heap.insert(-1*i,-1*i);
        }
      

10. What is the worst-case running time of the following function? Use Big-O notation.

      void f(int n) {
        if (n < 0) {
          return;
        }
        BinaryHeap<int,int> heap;
        for (int i = 0; i < n; ++i) {
          heap.insert(i,i);
        }
        for (int i = 0; i < n; ++i) {
          cout << heap.removeMin() << endl;
        }
      }
    

Home Page