{"repo":"KhaledAshrafH/B-Tree","free":true,"listed":false,"github":"https://github.com/KhaledAshrafH/B-Tree","clone":"git clone https://github.com/KhaledAshrafH/B-Tree.git","description":"This contains a C++ code that implements a B-Tree data structure. A B-Tree is a self-balancing tree that can store and retrieve data efficiently. It is commonly used in databases and file systems.","language":"C++","stars":19,"topics":["b-tree","cpp","data-structures","generic","scratch-implementation","template","b-tree-implementation"],"license":"MIT","category":"saas-starters-boilerplates","readme_excerpt":"B-Tree Implementation in C++ This contains a C++ code that implements a B-Tree data structure. A B-Tree is a self-balancing tree that can store and retrieve data efficiently. It is commonly used in databases and file systems Motivation I created this code as a part of my Advanced Data Structure Course . I wanted to learn how to implement a B-Tree from scratch and understand its operations and applications. I also wanted to practice using templates and dynamic memory allocation in C++. Features - The project defines a template class BTree that can store any type of data T with a given order Order . - The project also defines a template struct Node that represents a node in the B-Tree. Each node has an array of keys, an array of child pointers, and some other attributes. - The project provides methods for inserting, searching, splitting, and printing the B-Tree. Why B-Tree? B-Tree is a powerful data structure that offers many advantages over other data structures. Here are some of the reasons why you should use B-Tree for your data: - Fast and Scalable : B-Tree has a low height and a high branching factor, which means that it can store and access a large amount of data with a small number of disk I/Os. The time complexity for searching, inserting, and deleting a key in a B-Tree is O (log n), where n is the number of keys in the tree. This is much better than the linear or quadratic time complexity of other data structures such as arrays, linked lists, or hash tables. - Sorted a","default_branch":null,"files":null,"tree":[],"storefront":"/r/KhaledAshrafH","claimed":false,"request_supported":{"post":"https://gitbuyer.com/r/KhaledAshrafH/B-Tree/request-supported","requests":0},"note":"indexed from public GitHub; nothing is for sale on this page. Clone it from GitHub. Paid listings live at /search."}