[NEW ALGORITHM] Add B-tree, binary heap, Circular array, Circular linkedlist, double ended queue, circular queue.

[Richajaishwal0]

Description:

• B-tree: A balanced tree that allows quick search, insert, and delete operations, commonly used in databases.
• Binary Heap: A complete binary tree used for priority queues, where the parent node is either greater (max heap) or smaller (min heap) than its children.
• Circular Array: An array where the end connects to the start, allowing efficient rotation of elements.
• Circular Linked List: A linked list where the last node points to the first, enabling continuous traversal.
• Deque (Double-Ended Queue): A data structure allowing insertions and deletions from both ends.
• Circular Queue: A queue implemented with a circular array, where the last position connects to the first.

Checklist:

• [X] Contributor in GSSoC-ext
• [X] Want to work on it

Additional Information:

In this issue, I am exploring the implementation and understanding of various data structures, including B-trees, binary heaps, circular arrays, circular linked lists, deques, and circular queues. These structures are essential for efficient data storage, manipulation, and retrieval, each serving distinct use cases such as database indexing, priority management, continuous data traversal, and flexible queue operations.

[github-actions[bot]]

👋 Thank you for raising an issue! We appreciate your effort in helping us improve. Our team will review it shortly. Stay tuned!