Welcome to the B-Tree and B+Tree Visualization project! This repository hosts a collaborative effort to implement visually engaging and interactive visualizations of B-Tree and B+Tree structures. The goal is to provide a comprehensive learning resource for understanding these fundamental data structures. This project is implemented as the CS4488 Capstone Project at Idaho State University.
B-Trees and B+Trees are self-balancing tree data structures widely used in databases and file systems for efficient storage and retrieval of data. This project aims to create intuitive visualizations that showcase the dynamic behavior of these trees during various operations such as insertion, deletion, and search.
- Visualize B-Tree and B+Tree operations
- Allow user selection of the degree of the tree for B+Tree
- Differentiate between non-leaf and leaf nodes
- Animated representation of changes during tree operations
- /src: Contains the source code for the B-Tree and B+Tree visualizations.
- /docs: Documentation files, including user guides and developer documentation.
- /tests: Unit tests for ensuring the reliability of the implementations.
Here is where the project management and other documentation documents can be linked.
- Gantt Chart
- Task Breakdown Diagram
- Kanban Board
- Use Case Diagram
- Class Diagram
- Sequence Diagram
- Component Diagram
- Entity-Relationship Diagram
- Communication Diagram
- Deployment Diagram
- Class Diagram (detailed)
- Activity Diagram
This project is licensed under the MIT License.
- Andreas Kramer
- Tristan Anderson
- Dakoda DeAnda
- Emily Elzinga
- Alice Giola
- Zackary Beck