An Efficient Algorithm For The Automatic Construction Of AVL Tree Without Rotations By Sorting Technique

In this paper we propose a new algorithm for AVL Tree with Elimination of rotations by using sorting Technique. The basic idea of this paper is easy to implement and understand, to increase the performance by elimination of rotations. This can be achieved by sorted the given elements, then apply divide and conquer technique to split the given elements into subsets. Then construct the binary search tree individually and then merge the trees. In this paper we prove the effectiveness of the AVL tree performance is achieved by without rotations by using sorting Technique.