https://github.com/rationalcrafter/avl_tree

Simple implementation of an AVL tree set data structure
https://github.com/rationalcrafter/avl_tree

algo c data-structures

Last synced: 3 months ago
JSON representation

Simple implementation of an AVL tree set data structure

• Host: GitHub
• URL: https://github.com/rationalcrafter/avl_tree
• Owner: RationalCrafter
• Created: 2024-09-09T16:38:15.000Z (10 months ago)
• Default Branch: master
• Last Pushed: 2024-09-09T16:58:53.000Z (10 months ago)
• Last Synced: 2025-02-09T12:27:29.047Z (5 months ago)
• Topics: algo, c, data-structures
• Homepage:
• Size: 12.7 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README

Awesome Lists containing this project

README

        
An AVL Tree is a self-balancing binary search tree where the difference between the heights of the 

left and right subtrees cannot be made more than one for all the nodes. If at any point the height 

becomes more than one, the tree balances itself through rotations.