This lab will will focus on implementing a few missing sections of a BTree data
structure. To prevent confusion, we are focusing particularly on ‘B-Trees’ (NOT
We will also go a bit over the benefits of using a BTree and will give you an
overview of the implementation you will be working with.
Task 1 (2 marks): Complete the insert and split methods inside BTree.java.
Task 2 (mandatory but not assessable): Complete the max method of the
BTreeNode class within BTree.java
You are free to add helper methods within BTree.java to help you accomplish
Task 1: The SRNG Returns!
*A little while after lab 4*
Our alien friend was distraught at the thought that their Super Random Number
Generator (SRNG) idea did not take off. WHY they wondered? WHY did they fail
with their new innovations, yet Elon Musk succeed with a typical flamethrower?
Then, they came to a conclusion: more is always better. So they decided to upgrade
the SRNG to store 10,000,000 randomly generated numbers!
Task 1: A Light of Hope!
Soon, they had a soul crushing realisation: AVL Trees were too slow! However,
they saw a glimmer of hope from a long time friend. During a discussion, the
brilliant idea of using a B-Tree was brought up!
Task 1: The Final Push For SRNG
In pursuit of their dreams, they sent an unfinished B-Tree implementation to
Task 1: Insert and Split
Complete the insert and split functionality of a B-Tree found in BTree.java. As
was said before, feel free to add helper methods to achieve this task.
If you are having difficulty visualising how these operations work, take a look at
the University of San Francisco’s B-Tree visualisation website
本网站支持淘宝 支付宝 微信支付 paypal等等交易。如果不放心可以用淘宝交易！
E-mail: firstname.lastname@example.org 微信:itcsdx