An AVL tree is another balanced binary search tree. Named after their inventors, Adelson-Velskii and Landis, they were the first dynamically balanced trees to be proposed. Like red-black trees, they are not perfectly balanced, but pairs of sub-trees differ in height by at most 1, maintaining an O(logn) search time.
Write a program that returns the in-order traversal of the AVL tree nodes’ values.
Sample input
41,20,65,11,29,50,26,23
Sample output
Inorder traversal: [11, 20, 23, 26, 29, 41, 50, 65]
