Closed Vedansh-Keshari closed 9 months ago
Hey I would like to work on this
Hey @surajvast1, Assigned.
You may contribute your code under the folder path -
Issue completion deadline - 30th Oct 10:00:00 am IST
NOTE - In case the issue completion deadline is not met, the issue will be assigned to a new participant
Hi @SarthakKeshari, kindly assign this issue to me. I think this would be a challenging and exciting issue to work on.
Hey @ShivamPatel-24, Assigned.
You may contribute your code under the folder path -
Issue completion deadline - 06th Dec 09:00:00 am IST
NOTE - In case the issue completion deadline is not met, the issue will be assigned to a new participant
@ShivamPatel-24, Abiding by the guidelines, kindly do not create PR unless the issue is assigned.
@SarthakKeshari That makes sense, I will be mindful of that from now on.
By the way, this task was incredible. The most challenging part was keeping the Tree balanced all the time even when the edge cases were applied and updating its visualization to correspond with the changes.
A more suitable title for this issue can be Balanced Binary Search Tree Visualizer.
Thanks @ShivamPatel-24 for your input. I have made a note of it and will take into consideration while launching the next version of the website.
Enter calculator name -
Binary Tree Visualizer
Describe calculator functionality -
As the name suggests , the Binary Tree Visualizer takes values in an array one by one as long as the user wants and makes / updates / changes / modifies the Binary tree in real time by adding step by step how the final tree is reached. The rotations which are typically used in self-balancing binary search trees like AVL trees are LL Rotation (Left-Left Rotation) , RR Rotation (Right-Right Rotation) , LR Rotation (Left-Right Rotation) , RL Rotation (Right-Left Rotation) .
Use these rotations wisely by adding one element of the array at a time in order from the beginning to the end.
Under which category you wish to place it -