Algo_ds_101: AVL Tree

Created on 2 Oct 2020  路  5Comments  路  Source: ahampriyanshu/algo_ds_101

Submission Title
AVL Tree

Submission Type
DS

Submission Description
AVL tree is a self-balancing Binary Search Tree where the difference between heights of left and right subtrees cannot be more than one for all nodes.

Contributors

  • [x] C++ -
  • [ ] C -
  • [x] Python -
  • [ ] Java -
  • [ ] JavaScript -
  • [ ] TypeScript -
  • [ ] Golang -
  • [ ] Ruby -
  • [ ] Scala -
C++ Hacktoberfest New Submssion TypeScript first timer java javascript python ruby scala

Most helpful comment

Please assign me this. I will submit my work in C++.

All 5 comments

Please assign me this. I will submit my work in C++.

Hi, Would like to do this in python. Please assign it if possible.

Dear @sbhavya18 Kindly make a valid PR

@Mr-Vaibhav-Shukla Thanks for pointing out. This is my first attempt in making pull request. Can u please tell me where did I go wrong.

Hi @sbhavya18 :wave: , it looks like you are creating a PR within the different branches of your forked repo.
Kindy create a PR from your forked repo to the master branch my repo.
See the new README.md for more clarification:v:

Was this page helpful?
0 / 5 - 0 ratings

Related issues

ahampriyanshu picture ahampriyanshu  路  5Comments

Nirali0029 picture Nirali0029  路  4Comments

aakashsoni-cloud picture aakashsoni-cloud  路  3Comments

Jaswantsinghh picture Jaswantsinghh  路  5Comments

subhayuroy picture subhayuroy  路  5Comments