For quiz #3 on May 14 in CS 2500, here are some suggestions about the kinds of things to study: * Basic tree definitions and nomenclature -- terms like binary tree, binary search tree, subtree, full tree, complete tree, height, level, path, leaf, internal node, parent, sibling, ancestor, descendent, root, and so forth. * Be aware of the various traversal orders possible, the order they visit nodes in an arbitrary binary tree, and their possible applications. * Understand the basics of what SearchTreeInsert and SearchTreeDelete do. Given an initial diagram of a binary search tree, be able to make another diagram showing what the tree will look like after some series of insertions and deletions you are told about. * Understand how the efficiency of search in a binary search tree is related to whether the tree has near minimum height. Be prepared to discuss the big-O of various binary search tree operations - both average cases and worst cases. Reminder: The optional make-up quiz will be held on Tuesday, May 26, 1998 from 9:00 to 11:00 a.m. in C-202. Your grade on this exam may be used to replace your lowest quiz score.