📄 IJAERD-OJS-3922
A SURVEY ON DIFFERENT METHOD OF BALANCING A BINARY SEARCH TREE
| Author(s) | : | B. Deepa, Reshmi. S, Kirthika. B |
| Institution | : | Department of Information Technology, Sri Krishna Arts and Science College |
| Published In | : | Vol. 4, Issue 10 — October 2017 |
| Page No. | : | 660-664 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Abstract
This paper empirically examines the various ways of balancing the binary search tree. Since we know how toconstruct a binary search tree the only thing left is to keep it balanced. Obviously, we will need to re-balance the tree oneach insert and delete, which will make this data structure more difficult to maintain compared to non-balanced search trees,but searching into it will be significantly faster.
🕮 How to Cite
B. Deepa, Reshmi. S, Kirthika. B, “A SURVEY ON DIFFERENT METHOD OF BALANCING A BINARY SEARCH TREE”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 10, pp. 660-664, October 2017.
Related Papers
Compact Tunable SIW Cavity Resonator Design for Ku-Band Applications
Hassan Al-Kuwari
