Question

c++

c++

Research and describe a data structure other than the five listed in the session notes. Include at least five sentences and a screenshot of the data structure.

► Description:

► Screenshot:

Answer 1

AVL Tree:
-----------

AVL tree is height balanced binary search tree
height of binary search tree in worst case can be O(n), which is not good for operations such as insertion/search.
so, since AVL tree has a height if O(log n), operations such as insertion/search/deletion are always O(log n)
In an AVL tree, the heights of the two child subtrees of any node differ by at most one
if at any time they differ by more than one, rebalancing is done to restore this property.