Date: Tue, 27 Nov 2007 16:31:57 -0600 (CST) From: Mark Jacobson To: 810-080-02-fall@uni.edu Subject: [810-080-02-FALL] Binary search trees and Hash Tables... Hi Discrete students, Study the following material, which is linked on week #14 row of the web page: http://cns2.uni.edu/~jacobson/c080.html Binary Search TREEs, i.e. BST will be a topic after a happy Thanksgiving break. http://cns2.uni.edu/~jacobson/trees.html The Hash Table will also be covered during week #14. With Hash Tables and with Binary Search Trees, you will learn how to calculate the average successful search performance for the data structures. http://cns2.uni.edu/~jacobson/hashTables.html The following assignment should be started before class on Thursday. http://cns2.uni.edu/~jacobson/080/hashingAssign.gif (Note: I cannot change the Due date: Friday April 1st, 2005 since it is a GIF file. Well, if I download it and use Photoshop, I suppose I could.) The 3 hash tables assignment at http://cns2.uni.edu/~jacobson/080/hashingAssign.gif will be collected on Tuesday, December 4th, but much more will be added to it during our 28th class and last class of November this Thursday, November 29th. ----------------------------------------------------------------------- Please read the excursion 7.6 Excursion Binary Trees pages 581 through 595 of the textbook too. Compare the textbooks definition of a binary tree on page 583 with the lecture notes definition of a binary tree. What is a leaf? ----------------------------------------------------------------------- Mark