Back to Quizzes

Quiz 6

Quiz 6 Recursive Trees

In this exam you will have two programing problems both will be recursive functions for tree datastructures. The first willl be very short such as height() the second will be more complex such as mirror() from lab_trees.

Topics from lecture:

  • All C++ concepts
  • List, Stack and Queue ADT
  • Binary Trees
    • Binary Tree (not a BST)
    • Binary Search Tree
      • Tree traversals
      • Operations: find, insert, and remove
    • AVL Tree
      • Balance factor
      • Tree rotations
      • Operations: find, insert, and remove
      • AVL applications (nearest neighbor; range finding)
  • BTrees will NOT appear on this exam

Assignments referenced:

  • All assignments, with specific focus on:
    • lab_trees

Points:40

Registration: Monday, March 30

Start: Monday, March 30

End: Monday, March 30