Managing data structures was interesting to me, so I started this project to learn how I might balance a changing binary search tree. The AVLTree was the easiest method, so I started here. This is not meant to prove that the AVL method works in all cases; the proof for the AVL Tree's effectiveness was published in a paper in 1962. Instead, this project was an attempt to rediscover the effectiveness of AVL Trees for myself. The code is my own, but the theory came from some textbook I found online.
-
Notifications
You must be signed in to change notification settings - Fork 0
lderrickable/AVLTree
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published