implement balanced binary search tree visualizer

[ShivamPatel-24]

Issue Id you have worked upon - #528

I created a balanced binary search tree visualizer

Briefly explain your program logic -

• AVL Tree for Balancing: An AVL tree is used to keep the data balanced. Whenever a new value is added, it is inserted into the AVL tree, which automatically balances itself.
• Sorted List Generation: After each insertion, the AVL tree is traversed in-order to generate a sorted list of values.
• Balanced BST Construction: A balanced Binary Search Tree (BST) is built from the sorted list for visualization. This is done by a recursive function that selects the median value as the root, ensuring the tree is balanced.
• Visualization Update: Each time a new value is added and the AVL tree is updated, the visualization is redrawn to reflect the balanced state of the BST.

Screenshots(Attach 2 screenshots of your own input and output) -

Code

Result

By raising this PR I affirm that -

• [x] My code follows the guidelines of this project.
  

• [x] I have performed a self-review of my own code.
  

• [x] I have commented my code.
  

• [x] My code gives the correct output.
  

• [x] I affirm that I strictly follow contributing guidelines and code of conduct.

[vercel[bot]]

The latest updates on your projects. Learn more about Vercel for Git ↗︎

Name	Status	Preview	Comments	Updated (UTC)
calc-for-everything	✅ Ready (Inspect)	Visit Preview	💬 Add feedback	Nov 26, 2023 1:15am

[SarthakKeshari]

Congratulations 🎉 @ShivamPatel-24 on your contribution. Thanks for adding value to this repository. 😊