2-PA-dueOct30

2-PA-dueOct30 - CSC 3102 Programming Assignment 2...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC 3102 Programming Assignment 2 Construction of a 2-3-4 Tree Due: October 30, Thursday (by 11:55 pm) Points: 5 Penalty: You will lose one point per delayed day Submit your work as instructed towards the end of this document. Contact TA Di Lin by e- mail to [email protected] or me by e-mail to [email protected] for help. Objective: To write a program for constructing a 2-3-4 tree for a given list of n integers. Background: A top-down 2-3-4 tree is a B-tree of order 4. See the question 6 from Exercise 7.4 of the textbook. It applies the following modification of the insert operation: Whenever a search for a leaf for a new key encounters a full node (i.e., a node with three keys), the node is split into two nodes by sending the middle key to the node’s parent (or, if the full node happens to be the root, the new root for the middle key is created). The principal advantage of splitting full nodes (i.e. 4-nodes with 3 keys) on a way down during insertion of a new key lies in the fact that if the appropriate leaf turns out to be full, its split will never cause a chain reaction of
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/06/2009 for the course CSC 3102 taught by Professor Kraft,d during the Fall '08 term at LSU.

Page1 / 2

2-PA-dueOct30 - CSC 3102 Programming Assignment 2...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online