CSci 1301: Lab 6

You may work in pairs (preferred) or individually.

What to submit

At the end of the lab please send me and your group partner(s) all your Scheme files as e-mail attachments. My e-mail is elenam at morris.umn.edu. The subject of your e-mail must be "1301 Lab 6" followed by "Final" or "Not final", depending on whether this is a final submission or you are still working on it. If you need to finish it, make sure to set up a time with your group partner(s) to finish the lab.

When to submit

Due Monday, November 1st, at 11:59pm. If you submit the final version during the lab, you are done.

Lab task (15 points): binary serach trees

For a binary search tree in-class example write the following three methods that work on a bianry search tree:

  1. preorder that returns a list of ssn values in a given tree recursively in the order Node, Left Subtree, Right Subtree. For the tree mytree given in the example the expected result is
    
    (list 63 29 15 10 24 89)
    
  2. postorder that returns a list of ssn values in a given tree recursively in the order Left Subtree, Right Subtree, Node. For the tree mytree given in the example the expected result is
    
    (list 10 24 15 29 89 63)
    
  3. A function reverse-inorder that returns a list of ssn values in a given tree recursively in the order Right Subtree, Node, Left Subtree. Do not use a function reverse. For the tree mytree given in the example the expected result is
    
    (list 89 63 29 24 15 10)
    

CSci 1301 course web site.

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.