Skip to content
/ AVL-tree Public

AVL tree is a self-balancing Binary Search Tree where the difference between heights of left and right subtrees cannot be more than one for all nodes.

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

Mahgabin18/AVL-tree

BranchesTags

Repository files navigation

AVL-tree

AVL tree is a self-balancing binary search tree in which each node maintains extra information called a balance factor whose value is either -1, 0 or +1.

AVL tree got its name after its inventor Georgy Adelson-Velsky and Landis.

About

AVL tree is a self-balancing Binary Search Tree where the difference between heights of left and right subtrees cannot be more than one for all nodes.

Topics

tree avl-tree tree-structure avl avl-tree-implementations

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages