add b-tree data structures algorithm

[Vatsmanglam]

Description of Change

Added B-tree data structures which is a special type of self-balancing search tree in which each node can contain more than one key and can have more than two children. It is a generalized form of the binary search tree. It is also known as a height-balanced m-way tree.

Checklist

• [x] Added description of change
• [x] Added file name matches File name guidelines
• [x] Added tests and example, test must pass
• [x] Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
• [x] Relevant documentation/comments is changed or added
• [x] PR title follows semantic commit guidelines
• [x] Search previous suggestions before making a new one, as yours may be a duplicate.
• [x] I acknowledge that all my contributions will be made under the project's license.

please add hacktoberfest label

[github-actions[bot]]

This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.