https://github.com/neuodev/avl-trees
In this Repo, I Built an AVL Tree that can balance itself to avoid right or left skewing and to be more efficient. Implementing Right(RR) , Left(LL), Right Left (RL), Left-Right (LR) Rotations
https://github.com/neuodev/avl-trees
Last synced: about 1 month ago
JSON representation
In this Repo, I Built an AVL Tree that can balance itself to avoid right or left skewing and to be more efficient. Implementing Right(RR) , Left(LL), Right Left (RL), Left-Right (LR) Rotations
- Host: GitHub
- URL: https://github.com/neuodev/avl-trees
- Owner: neuodev
- Created: 2021-04-08T18:34:33.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2021-04-08T18:45:24.000Z (over 5 years ago)
- Last Synced: 2026-03-31T05:39:15.362Z (4 months ago)
- Language: TypeScript
- Homepage:
- Size: 55.7 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
#### AVLTrees
In this Repo I Built an AVL Tree that can balance it self to avoid right or left skewing and to be more efficient
Implementing Right(RR) , Left(LL), Right Left (RL), Left Right (LR) Rotations
### Types of Rotations

### To say that the tree is balanced it's height must be less that or equal 1
