The Final Project for the Data Structures and Algorithms I course was to implement a B-Tree together with a GUI to manipulate it, in Java. It has manual input to search for a value, enter it or delete it, to load numbers from a text file, insert numbers in sequence from 1 to n, or n random numbers. If the tree grows large enough to get "off screen", you can drag it with the mouse. It takes a while to load because it downloads the background image from the internet.
This was made for educational purposes and is licensed under the MIT License.
Prueba / Test: Select kind of test.
Cargar Caso / Load Case: Test by loading numbers from a text file.
Numeros en Secuencia / Sequential Numbers: Test by inserting first n numbers, from 1 to n.
Numeros Aleatorios / Random Numbers: Test by inserting insert n random numbers.
Insertar / Insert : Insert a given number.
Buscar / Search : Search for a given number.
Eliminar / Delete : Delete a given number.
