[Current] [News] [Glance] [Search] [Instructions] [Links] [Handouts] [Project] [Outlines] [Labs] [Homeworks] [Quizzes] [Exams] [Examples] [EIJ] [API]
Back to Trees, Continued. On to Dictionaries.
Held Wednesday, November 22, 2000
Summary
Today we conclude our initial discussion of trees by considering an application of trees (Huffman codes) and traversal mechanisms for trees.
Notes
Overview
While you have more than one tree Pick the two smallest trees Merge 'em into one, with new frequency
Wednesday, 23 August 2000
Thursday, 24 August 2000
Wednesday, 22 November 2000
Back to Trees, Continued. On to Dictionaries.
[Current] [News] [Glance] [Search] [Instructions] [Links] [Handouts] [Project] [Outlines] [Labs] [Homeworks] [Quizzes] [Exams] [Examples] [EIJ] [API]
Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.
This page may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2000F/Outlines/outline.48.html
Source text last modified Wed Nov 22 08:51:00 2000.
This page generated on Wed Nov 22 09:00:37 2000 by Siteweaver. Validate this page's HTML.
Contact our webmaster at rebelsky@grinnell.edu