BALANCED LINKED LIST

BaLL

Abstract

In this paper, a modified version of linked list, called balanced linked list (BaLL), has been proposed. It performs better than standard sorted linked list (SoLL) both theoretically and experimentally for maintaining a sorted sequence of data. The modification in BaLL than SoLL is to maintain a special middle node instead of head, and to maintain the remaining nodes in two sorted lists of almost equal size. Three most basic operations, search, insert and delete, have been considered in BaLL and have been compared with the same set of operations in SoLL. For these three operations, BaLL performs theoretically 50% better and experimentally around 50% better than SoLL.