Project 3
Fall 2020
Due: F 10/23 @ 5 PM
10 points
Implement Cormen et al.'s B-tree algorithms for the class BTree<K>. The constructor must take t, the order of the B-tree, as a parameter. We will be storing only the key.
I put some starter code on cs-class, which you can retrieve using the command:
cs-class% cp ~maloofm/cosc160/p3.zip ./
We will discuss the recommended private methods in class.
Operations on siblings should attempt such operations on the left sibling first and the right sibling second. For example, for a case-3a removal, the implementation should attempt to perform the removal on the left sibling first. If the left sibling has too few keys, then it can attempt the operation on the right sibling.
Instructions for Electronic Submission: In a file named HONOR, please include the statement:
In accordance with the class policies and Georgetown's Honor Code, I certify that, with the exceptions of the class resources and those items noted below, I have neither given nor received any assistance on this project.Include this file in your zip file submit.zip.
Submit p3 exactly like you submitted p2. Make sure you remove all debugging output before submitting.
If something goes wrong with Autolab, upload your zip file to Canvas.
Copyright © 2020 Mark Maloof. All Rights Reserved. This material may not be published, broadcast, rewritten, or redistributed.