A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST
Journal Title: Indian Journal of Computer Science and Engineering - Year 2013, Vol 4, Issue 4
Abstract
Tree is a best data structure for data storage and retrieval of data whenever it could be accommodated in the memory. At the same time, this is true only when the tree is height-balanced and lesser depth from the root. In this paper, we propose a sorting based new algorithm to construct the Balanced search tree from Binary Search Tree with minimum of one rotation for the given elements n >14. If the given elements n < 14 then the algorithm automatically constructs the Balanced Search tree without needs any rotations. To maintain the tree in shape and depth, we apply two strategies in the input data. The first one is to apply sorting on the given input data. And the second one is to find the multiples of two positions on the sorted input data. Then, we compare the 3 positions of multiples of two and rewrite it by descending order and repeat this for the entire elements and the rest of the positions also on the sorted data. After, a new input data is formed. Then construct the Binary search tree on the given input data. At last, we will find the output as; a height balanced BST (AVL) with lesser depth from the root for the smaller data such as N < 14, for the greater element N >14 , it requires one rotation from the BST., and the search cost is minimum as possible. In this paper, few case studies have been carried out and analyzed in terms of height and space requirement. Hence, the height of the output BST, normally obtain by maximum height as N/2 or (N/2) – 3.
Authors and Affiliations
S. Muthusundari , Dr. R. M. Suresh
Keywords
Related Articles
- EP ID EP161941
- DOI -
- Views 90
- Downloads 0
E-GOVERNMENT DATABASES: A RETROSPECTIVE STUDY
The government is the biggest producer of information and efficient management of the vast amount of data available within the government departments is of utmost importance. Due to the advent of information and communic...
RELIABLE MULTI PATH ROUTING FOR 802.16 WIRELESS MESH NETWORKS
The effective technique to avoid congestion and losses in networks is by multipath routing. Multipath routing constructs multiple paths for a source and destination and provides fault-tolerance and reliability. In IEEE 8...
DATA MINING: A ‘RIM’ ALGORITHM FOR SPYWARE DETECTION WITH PRUNING
The aim of this paper is to employ the principles of data mining and classify a new algorithm. In this method, we have proposed a new anti-spyware system (Spyware Detection), which is capable for classifying spyware file...
A Model to ICT and E-Governance for Intermediate Organizations in India
Intermediate organizations are one of the areas where governments of developing countries can invest since intermediate organizations (IOs) play a vital role in economic growth. The application of ICT and e-governance ha...
A Novel Architecture for Domain Specific Parallel Crawler
The World Wide Web is an interlinked collection of billions of documents formatted using HTML. Due to the growing and dynamic nature of the web, it has become a challenge to traverse all URLs in the web documents and han...