Hello everyone
I know this question is a little out of place because I actually want to pragram this in C, but I'll ask it anyways in case one of you guy would like to help :
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.
Thank you so much if you help !!