康奈尔数据库assignment代写，Java实现B+ tree

题目描述： 1 Coding Part: B+ Tree (50 points) A Note on Academic Integrity: You may discuss your solutions with other students in the class, but do not copy any code from any other students in the class. We will be running submissions through an automated tool that detects code similarity; if you copy code, you will get caught. In this section, you are asked to implement a basic BPlusTree structure as described in the textbook (pages 344-356). For simplicity, you can assume for this project: • no duplicate keys will be inserted • keys will implement interface Comparable 1.1 Description A B+ tree is balanced tree structure in which the index nodes direct the search and the leaf nodes contain the data entries. (1) Constraints and Properties of B+ trees: • Keys are sorted in the nodes. • Nodes are sorted by their keys. For Index Nodes, the B+ tree asserts that for all keys k and adjacent pointers, before(k) and after(k), it must be that: In other words, k is the key that divides the