Please answer all question clearly.

Week 8

Work through 3.1 Elementary Symbol Tables slides 1-32

Then work through 3.2 Binary Search Trees 1-3

Act out 32DemoBinarySearchTree flor slides 4 and 5 with chairs arranged in a tree as illustrated in the demo and the students wearing the letter placards

If possible. have students in lab or lecturer at lectern computer work through Java examples on slides 7-11. Also slides 23 and 25, 26 and 28, 35 and 39

Homework Exercises

1. What is the advantage of a binary search tree over a binary tree?
2. Define min( ), max( ), floor( ), ceiling( ) for a BST.
3. How do insertions and deletions differ in a BST? What are the practical implications of this.
4. Take an initially empty tree. Insert the keys DATASTRUCTURES into the tree, associating value i with the ith key. How many compares are needed?