Implement an AVL tree.

[MarsIncarnate]

Implement a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.
Any languages could be used.

[ismaelsadeeq]

Hello Friend this issue has been assigned to you