Bplus-tree

Project from Data Structure and Algorithms II (2013.1)

The full specification in Portuguese can be found on the specification_project.pdf

Basic inputs:

1: INSERT

1th line: i
2th line: key
3th line: string representing a name (max 20 characters)
4th line: integer representing an age (non-neg)

2: SEARCH FOR A RECORD

1th line: c
2th line: key to be found

3: REMOVE

1th line: r
2th line: key to be removed

4: PRINT TREE

1th line: p

5: PRINT LEAF NODES

1th line: f

6: EXIT

1th line: e