Homework 3

Due Wednesday, August 25th @ 8pm. Must be submitted electronically in PostScript, PDF, or plain text format.
  1. What is the maximum depth of a 2,3-Tree that has 15 values?
  2. What is the minimum depth of a 2,3-Tree that has 15 values?
  3. What is the maximum depth of a BST that has 15 values?
  4. What is the minimum depth of a BST that has 15 values?
  5. Draw the BST that you would get by starting with an empty tree and inserting the following values, in order 1 150 145 10 20 30 140 120 115 40
  6. Draw the 2,3-Tree that you would get by starting with an empty tree and inserting the following values, in order: 1 150 145 10 20 30 140 120 115 40
  7. Draw the 2,3,4-Tree that you would get by starting with an empty tree and inserting the following values, in order: 1 150 145 10 20 30 140 120 115 40
  8. Given this 2,3-Tree, draw the tree that results from removing the values 42, 17 and 9, in that order.