pydatastructs
pydatastructs copied to clipboard
codezonediitj
Add B+ tree data structures
Description of the problem
Example of the problem
References/Other comments
[1] https://en.wikipedia.org/wiki/B%2B_tree
Hi @poojasrinivass Feel free to start work on this issue. Please see our issue policy to get to know how to work on issues. As you will be adding a new data structure, please go through https://github.com/codezonediitj/pydatastructs/wiki/Plan-of-Action-for-the-Projects for the steps.
@czgdp1807 I would like to participate in gsoc2020 but I can't find the organization's name in the gsoc organizations list.
@faizan2700 Are you talking about Google Summer of Code, 2020 or GirlsScript Summer of Code, 2020?
We are not participating in GSoC, 2020 as the organization isn't mature enough. Though we are participating in RGSoC, 2020, the applications for which are open till 30th March, 23:00 UTCA.
@czgdp1807 well RGSOC is for girls. I still want to contribute in this repository ( without any gsoc or rgsoc programme) this repository seems really interesting.
Sure, you can contribute to this repository. For this issue, some use cases are needed to check if B+ trees are feasible for implementation in Python.
hi i am from girlscript sumer of code 2020 and i wnat to work on this issue. @robotjellyzone
Hi @Amitsharma45 yes, you can work on this issue but please discuss the API/your solution first here and send the PR according to PR policy.
Hi @Disha5harma since there is no reply from @Amitsharma45 so, you can begin to work on this issue. Before that, don't forget to share you API or solution here and also, follow all the PR rules before making a PR
My API design is as follows:
leaf_node:
This class is to perform operations on leaf nodes
attributes:
- previous_node: for keeping track of previous linked list node in leaf
- next_node: for keeping track of next linked list node in leaf
- parent: for keeping track of parent of the respective node
- order: order of the b+ tree
methods:
- align : sorts the elements of leaf and splits if required
- find : to return the elements at specified key
- split : to split the nodes of leaf if required at specified index
- delete_item : deletes the element specified at particular key
- balance : to balance the tree acc. to the order.
- is_root : checks if the element is parent or not
- size : returns the size of the leaf
node:
for parent nodes or internal nodes almost same functions as for above
attributes:
- previous_node
- next_node
- keys
- children
- parent
- order
methods
- manipulate
- find
- add_child
- change_key
- split
- delete_item
- balance
- is_root
- size
class
b_plus_tree:
for performing operations on whole tree using above functions and classes
attributes:
- order
- leaves
- root methods
- size
- split
- align
- find
- delete_item
Kindly if this API is suitable for this PR
It looks good to me, you can simultaneously propose the PR @Disha5harma , if you are still working on this
