[Feature Request]: Implementation of B-tree

[Richajaishwal0]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

The B-tree is a self-balancing multi-way tree data structure that maintains sorted data for efficient search, insertion, and deletion operations, typically in (O(\log n)) time. Each node can contain multiple keys and child pointers, allowing it to have a variable number of children, determined by its order (m). B-trees ensure all leaf nodes are at the same depth, providing a balanced structure that minimizes disk I/O, making them ideal for use in databases and file systems for indexing large volumes of data.

Record

• I agree to follow this project's Code of Conduct
• I want to work on this issue
• I'm willing to provide further clarification or assistance if needed.

Full Name

Richa Kumari Jaishwal

Participant Role

GSSOC, hacktoberfest

[github-actions]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!

[github-actions]

✅ This issue has been closed. Thank you for your contribution! If you have any further questions or issues, feel free to join our community on Discord to discuss more!