COSC 2011 Section N
Thursday, March 29 2001

This lecture will complete the discussion related to Binary Tree algorithms. The remainder of the lecvture will then be concerned with Data Structures to represent Trees and Binary Tree. Time permitting, Priority Queues will be introduced. As with Tuesdays lecture, it is recommended you review the following material:

The Tree Abstract Data Type: (which has already been covered in the lectures)

first edition: pages 149 - 15 (section 5.1)
second edition: pages 229 - 236 (section 6.1)

Here are the sections of the textbook:

1st edition book:

Pages	Section
165 - 172	5.3.3
180 - 184	5.4.2
185	5.4.3

2nd edition book

Pages	Section
251 - 257	6.3.4
265 - 271	6.4.2
271 - 271	6.4.3

Additional Material:

Source Code (written by Professor Franck van Breguel):

Pseudo code Implementation of a general tree with a binary tree (in PDF format) can be found here. (by Professor Franck van Breugel)
Some notes and information related to the mid-term test will be provided soon - check the Section N main page!