Skip to content

Developed and tested a small degree B+ tree in C++ for information storage and retrieval used for internal-memory dictionaries with operations like insert, search, delete, etc.

Notifications You must be signed in to change notification settings

ishitatrivedi/BPlus-Tree

Repository files navigation

BplusTree

B+ Tree Implementation for COP5536 Advanced Data Structures project assignment.

Usage

mkdir bptree
git clone https://github.com/ishitatrivedi/BplusTree.git bptree
make
./bplustree SampleInput.txt

Summary

  1. BPTree.cpp & BPTree.hpp

Definition and declaration of B+ Tree operations, including:

  • Initialize(3) : void Initialize (int m)
  • Insert(21, 0.3534) :void Insert (int key, float value)
  • Delete(108) : void Delete (int key)
  • Search(234) : bool Search (int key, float &value)
  • Search(23, 99) : bool *Search (int key1, int key2, float *&values, int &num)
  1. BPTreeNode.cpp & BPTreeNode.hpp

Definition and declaration of B+ Tree structure for operations, including:

  • BPTreeNode: Insert, Search, Delete, Merge, Split, GetChildren
  • InternalNode: Insert, Delete, Merge, Split, GetChildren
  • LeafNode: Insert, Delete, Merge, Split, GetValue
  1. main.cpp

The main entrance of code. Including file input and output processing.

About

Developed and tested a small degree B+ tree in C++ for information storage and retrieval used for internal-memory dictionaries with operations like insert, search, delete, etc.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published