AVL Tree Implementation

Abstract

This paper is about result of a series of simulation which investigates the performance of AVL tree. AVL Tree is a program develops in C++ to create and arrange data in hierarchical manner. In computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented. In an AVL tree, the heights of the two child sub-trees of any node differ by at most one. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.