Skip to content

Latest commit

 

History

History
7 lines (4 loc) · 348 Bytes

File metadata and controls

7 lines (4 loc) · 348 Bytes

oskhen-task-15

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:

AVL tree example

Kattis proof