Built an AVL tree, which is a self-balancing BST. Also support key:value pairs, for example to match each key with a corresponding string. You can then print the entire tree in the console, either by value or by keys. Example:
INDAPlus20/oskhen-task-15
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
