Skip to content
#

avl-tree-implementations

Here are 134 public repositories matching this topic...

This is a C++ implementation of an AVL tree, which is a self-balancing binary search tree. An AVL tree maintains the balance factor of each node, which is the difference between the heights of its left and right subtrees. Whenever a node becomes unbalanced (its balance factor is either -2 or 2), the tree performs a rotation to restore the balance.

  • Updated Aug 4, 2023
  • C++

Improve this page

Add a description, image, and links to the avl-tree-implementations topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the avl-tree-implementations topic, visit your repo's landing page and select "manage topics."

Learn more