Analysing Efficiency and Time Complexity of AVL Tree Re-balancing during Value Insertion

Himansh Chitkara

Abstract: This research paper experimentally models the efficiency of an AVL (Adelson-Velskii and Landis) Tree in re-balancing itself during the insertion of values, focusing on its time complexity. The study demonstrates a logarithmic relationship between the time required for insertion and re-balancing operations in the AVL Tree. Through empirical analysis, the paper provides valuable insights into the performance characteristics of AVL Trees and their suitability for handling large data sets. The findings highlight the effectiveness of AVL Trees in maintaining balance and optimizing insertion operations, contributing to the understanding of efficient data structures.

Keywords: Binary Tree, AVL Tree, Efficiency, Time Complexity, Re-balancing, Insertion Operations, Node, Balancing Algorithms