CPSC 311, Sec 501: Quiz 5
Feb 18, 2004

Name:________________________________________

  1. (1 pt) Draw the result of inserting the following keys, one at a time, in order, into an initially empty binary search tree: 1, 2, 9, 8, 3, 7, 4, 5.











  2. (1 pt) Draw the result of deleting 7 from the following binary search tree:











  3. (3 pt) What is main advantage of a B-tree over a binary search tree?