Construction of estimated level based balanced binary search tree

There are many storage structure available to store data in memory of many forms. These structures can be array, class, linked list with its various forms, Tree, Binary Tree, Binary Search Tree (BST), etc. These can be differentiated in two major forms. First one uses continuous memory allocation and the second one can occupy any free memory block by pointed by the other memory locations. An array occupies continuous memory space for storage purpose and the size should also be known before allocating the space. Perhaps we can use dynamic memory allocation methods for arrays but a Linked List provides better options. There is a disadvantage in Linked List, it does not allow to perform binary search operation on it. The Binary Search Tree is more efficient than the other mentioned data structures. BST provides the two way traversal direction but sometimes the structure of the BST can become unbalanced due to unprocessed ordering of inserted data. In this presented paper, the BST is considered as unbalanced if the number of levels is more than the levels which is required to hold the nodes. The unbalanced BST can lead to a straight tree structure with only one intermediate node at each and every level in the worst case scenario. The structure of BST depends on the insertion order of key elements. By changing the insertion order, BST can be made balanced. The proposed Estimated Level Based Balanced BST provides a solution for finding an insertion order of key elements which will not lead to unbalanced Balanced BST.