Implement AVL trees using Binary Tree.

[Shubhayu-Das]

Do the checklist before filing the issue:

• Do you have Node.js and all the relevant dev-dependencies installed?
• Is this a bug fix?
• Is this an enhancement?
• Is this a feature request?

NOTE: Provide a clear and concise description of the feature that needs to be added! Or if its a bug, then provide the necessary steps to reproduce it along with screenshots.

• Give your answer below:

---

A Binary Tree by itself can end up being skew, hence degrading it's efficiency. By balancing the Binary Tree using rotations we can ensure the height of the tree to be O(log n). AVL Tree is one way height-balance a Binary Tree.

For reference:
https://www.geeksforgeeks.org/avl-tree-set-1-insertion/

[Shubhayu-Das]

I would like to work on this.

[Shubhayu-Das]

Can I take another day for this one? I couldn't work on it in the morning and hardly have any time now. I can finish it by 7pm tomorrow evening though. Is that fine?

[fave77]

Sure @sateslayer

[fave77]

@sateslayer your time's up

[devRD]

can I work on this? Can you provide more details on how to implement this with an example?

[fave77]

@devRD you're assigned and check the issue #158 for more details. Include all the public methods mentioned there.

[devRD]

@pbiswas101 Can you please assign this task to someone else? I had some emergency and was unable to work on it.