Dynamic Efficiency: Algorithms for Maintaining Binary Search Trees

Bys: Sabah Mustafa, Iman and Kumar Awasthi, Yogesh

A Binary Search Tree (BST) optimizes search operations by organizing data for fast lookups, insertions, and deletions. Various balancing algorithms, including single and double rotations, have been developed to maintain this efficiency. While double rotations are effective, they consume more computational resources, potentially impacting system performance in environments with frequent searches.Evaluations of different algorithms for dynamically maintaining BSTs focus on unpredictable search patterns, managing tasks like inserting new nodes and restructuring the tree to reduce path length and search time. Height-Balanced Trees, such as AVL Trees, keep minimal height differences between subtrees for efficient searches, while Bounded-Balance Trees, like Red-Black Trees, allow more relaxed balancing for specific operations.Hybrid algorithms blend features of both tree types for enhanced performance. The paper presents a novel method that improves upon double rotations, achieving similar balancing results with nearly half the computational steps. This advancement promises to significantly enhance BST maintenance efficiency and overall system performance in dynamic search environments.

• Format: Paperback
• Language: English
• ISBN: 6208170680
• ISBN13: 9786208170684
• Release Date: September 2024
• Publisher: LAP Lambert Academic Publishing
• Length: 52 Pages
• Weight: 0.20 lbs.
• Dimensions: 0.1" x 6.0" x 9.0"