Binary Search Tree? Algorithm : <p>Does anyone know how to make an algorithm that transforms a binary search tree into an AVL tree, and yes transform it and not make another tree (so it will only be done using rotations) and not with the DSW technique... and in C. The tricky part here is that there is lots of cases since a binary search tree can be unbalanced in various ways and there being 4 types of rotations.</p>
