Comp 388-005 Week 4
Lewis Tower 415, 4:15-8:15
Welcome
Readings:
Sorting in Bailey and Morin
Binary trees
demo programs: inttree.cs,
In-class lab:
- get intraverse() to print in the other order, so that, turned on its
side, the output looks like a tree
- Try some random data-insertion orders.
Some ways to traverse a tree: traversers.cs
- traversal
- building
- ordered
- binary search trees
- versus hash tables
- recursive operations
- sum
- max
- depth
- search
- insert
Hashing
Array-list buckets vs Linked-list buckets
Open hashing
In-class lab: GetHashCode() values of strings in lab1
Study guide
space complexity: see lists.html#space,
the Table of Factors example.
List expand() and time-v-space tradeoffs
Parse trees again
Add a new level: factor -> efactor [ '^' efactor]
efactor -> ident | number | '(' expr ')'