https://github.com/khaledashrafh/avl-tree
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.
https://github.com/khaledashrafh/avl-tree
avl-tree avl-tree-implementation avl-tree-implementations balanced-binary-search-trees cpp scratch-implementation tree-traversal
Last synced: 8 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/khaledashrafh/avl-tree
- Owner: KhaledAshrafH
- License: mit
- Created: 2021-12-25T03:38:13.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2023-08-04T06:19:26.000Z (about 2 years ago)
- Last Synced: 2024-12-07T11:09:04.894Z (10 months ago)
- Topics: avl-tree, avl-tree-implementation, avl-tree-implementations, balanced-binary-search-trees, cpp, scratch-implementation, tree-traversal
- Language: C++
- Homepage:
- Size: 188 KB
- Stars: 10
- Watchers: 2
- Forks: 0
- Open Issues: 0