AVL TREE
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given a list of integers, implement a function that constructs an AVL tree from the list and a function that performs an in-order traversal of the tree
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<