This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSI2110 - Fall 2009 - Assignment 2 Posted: Monday, November 2 nd , 2009 Due: Monday, November 16 th 2009, by 11:00 pm Work alone! This is an individual assignment. Your answer has to be uploaded to Virtual Campus - No exceptions. There is a total of 20 points or 5 marks in this assignment plus 12 bonus points or 3 marks (Bonus will count only towards the assignments in the course). (2,5)-Tree In this assignment you will implement a (2,5) tree, a multi-way search tree which is defined exactly as (2,4) tree except that each node can have between two to five children. You will need to define an interface csi2110.MultiWaySearchTree<K extends Comparable<K>,V> and a class csi2110.Pair<K extends Comparable<K>,V> which holds a key, value pair and provides the comparator functionality. Your main implementation must be in the class csi2110.Tree2 5<K extends Comparable<K>,V> making use of csi2110....
View Full Document
This note was uploaded on 02/24/2010 for the course SITE CSI2110 taught by Professor Mohammadomar during the Fall '09 term at University of Ottawa.
- Fall '09