Implementing B-Tree in Python and C++

[dhruvmillu]

Implementing B-Tree in JAVA, python, C and C++

The B-Tree can handle massive amounts of data with ease. When it comes to storing and searching large amounts of data, traditional binary search trees can become impractical due to their poor performance and high memory usage. B-Trees, also known as B-Tree or Balanced Tree, are a type of self-balancing tree that was specifically designed to overcome these limitations.

B-Trees are characterized by the large number of keys that they can store in a single node, which is why they are also known as “large key” trees. Each node in a B-Tree can contain multiple keys, which allows the tree to have a larger branching factor and thus a shallower height. This shallow height leads to less disk I/O, which results in faster search and insertion operations. B-Trees are particularly well suited for storage systems that have slow, bulky data access such as hard drives, flash memory, and CD-ROMs.

Describe the solution you'd like

Implementing the following operation in B-Tree

• Search
• Insert
• Delete

In following languages

• C++
• Python

Please Assign this issue to me under SSoC 2.0

[Kumar-laxmi]

Assigned! @dhruvmillu : Python and C++

[shanvijha30]

@Kumar-laxmi I would like to work on this issue. Could you please assign it to me. Thank you!

[github-actions[bot]]

Stale issue message