Week 6 - Monday, September 25, 2006 to Friday, September 29, 2006

Binary Trees

Comments

     This week builds on the linked list concepts.  There is very little difference in the coding techniques between the two.  Trees have two pointers, left and right, instead of one next pointer.  The logic becomes more complicated because you must decide whether to go left or right, but it still uses the same pointer assignment concepts.  Now you will code   current = current->left or current = current->right  instead of   current = current->next     

     Remember that you have Lab 6 due on Friday, followed immediately by Project 2 on Sunday.  You will find that Lab 6 is just a modification of Lab 5 so it uses a binary search tree instead of a linked list.  Project 2 shares a lot of code in common with both labs.  The main difference is that Project 2 demands well designed code and Abstract Data Types and the Labs require the ability to delete a node.  Deletion is not part of Project 2. 

Course Content

    Week 6:
    Binary Trees

Readings

Deitel and Deitel Fifth Edition, 21.7 - same caveats as the Deitel linked list readings .

Deitel and Deitel Fourth Edition, 17.7 - same caveats as the Deitel linked list readings .

Lab Assignment

    Lab 6
 

Week 6 Test

    12 Questions for 4 points, with fractions rounded up.

    Only available Friday, September 29th, from 6:00 am to 3:00 am Saturday morning on Angel.  It will cover the following material:   

• Conceptual questions or questions about code, all based on material covered in the Week 6 Course Content.  The Deitel & Deitel, since they use template based code, will not be included on the test.