An improved algorithm to maintain the Binary Search Tree dynamically

Abstract

Binary Search Tree (BST) is an acyclic graph that is widely used to arrange the data for optimal search. In order to maintain the binary search tree in optimal shape several algorithms have been proposed. A recently proposed technique [1] applies single and double rotations to balance the binary search tree. However, due to double rotation it takes almost double time as compared to single rotation; ultimately increasing the demand for memory and processor. In this paper we propose a new technique which solves the double rotation problem in almost half of the steps of existing algorithm.