Implementation of a Dictionary using the Data Structure AVL tree . AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.
-
Notifications
You must be signed in to change notification settings - Fork 1
Implementation of a Dictionary using the Data Structure AVL tree . AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.
amit21AIT/Implementation-Of-a-Dictionary-using-AVL-Tree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of a Dictionary using the Data Structure AVL tree . AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published