Topics Covered

Monday, Aug 29, 05: User-defined header files, splitting the program into 
3 parts, default arguments, default constructors, a constructor that works 
as both default and non-default, const members, static members.

Wednesday, Aug 30, 05: More on static members, friend functions, friend 
classes.

Friday, Sep 2, 05: Review of arrays and arrays as arguments and 
parameters, overloaded functions.

Wednesday, Sep 7, 05: Overloaded operators.

Friday, Sep 9, 05: Continuation.

Monday, Sep 12, 05: Continuation, unsorted lists (beginning of Chapter 3).

Wednesday, Sep 14, 05: quiz, continuation.

Friday, Sep 16, 05: continuations.

Monday, Sep 19, 05: Program for UnsortedType, Binary Search, SortedType.

Wednesday, Sep 21, 05: Finish SortedType, Big O.

Friday, Sep 23, 05: Finish Big O, Concepts of Objected Oriented 
Programming (OOP).

Monday, Sep 26, 05: pointers.

Wednesday, Sep 28, 05: continue with pointers, pointers to structs 
and classes, dynamic arrays.

Friday, Sep 30, 05: Quiz, dynamic variables and more about dynamic arrays.

Monday, Oct 3, 05: Stacks with header files, static arrays, templates 
with one parameter, and exception classes.

Wednesday, Oct 5, 05: Stacks with static arrays, templates with two 
parameters, exception classes, and with no header files. Stacks with  
dynamic arrays, templates with one parameters, exception classes, and with 
no header files.

Friday, Oct 7, 05: Exam I.

Monday, Oct 10, 05: queues with templates, exception classes and dynamic 
arrays.

Monday, Oct 17, 05: Exception handling, stacks as linked structures and 
with templates and exception classes.

Wednesday, Oct 19, 05: stacks as linked structures continued.

Friday, Oct 19, 05: queues as linked structures and with templates and 
exception classes.

Monday, Oct 24, 05: Unsorted Lists as Linked Structures (Unsorted Linked 
Lists) with templates and exception classes.

Wednesday, Oct 26, 05: Unsorted linked lists continued, examples.  

Friday, Oct 28, 05: quiz, sorted linked lists.

Monday, Oct 31, 05: Sorted linked list continued.

Wednesday, Nov 2, 05: Finished sorted linked lists, talked about circular 
sorted linked lists and sorted linked lists with headers and trailers, 
began doubly sorted linked lists.

Friday, Nov 4, 05: Finish doubly sorted linked lists.

Monday, Nov 7, 05: Begin recursion.

Wednesday, Nov 9, 05: Recursion continued.

Friday, Nov 11, 05: Recursion continued (exercises)

Monday, Nov 14, 05: Recursive methods for linked lists.

Wednesday, Nov 16, 05: Recursive methods for linked lists continued.

Friday, Nov 18, 05: Exam II (Material: queues, stacks, exception handling, 
queues, stacks, unsorted lists, and sorted lists as linked structures, 
recursion).

Monday, Nov 28, 05: Chapter 8: Trees, binary trees, binary search trees 
(BSTs), height and depth of the tree, proper binary trees, degenerate BST, 
leaves (external nodes), internal nodes, balanced BST, subtrees, left 
child, right child, siblings, descendent, parent, levels, insertion in 
BST, finding an item in a BST, running time of insert, find, and delete in 
BST.

Wednesday, Nov 30, 05: insertion in BST continued, deletion in BST, 
expression trees, BST tree traversal (inorder, preorder, postorder).

Friday, Dec 2, 05: BST tree traversal continued, tree (not necessarily 
binary) traversal, examples, implementation of BST.

Monday, Dec 5, 05: BST implementation contin.

Remaining lectures will be spent on binary search trees.