Fast AVL Trees & WAVL Trees in Java
-
Updated
Feb 2, 2018 - Java
Fast AVL Trees & WAVL Trees in Java
Haskell implementation of weak AVL trees + proofs on its functional correctness and amortised runtime complexity with LiquidHaskell
A word game developed as part of coursework for Habib University's CS 201 Data Structures II course. The game exhibits the power of Weak AVL Tree by storing the entire English dictionary*.
Add a description, image, and links to the wavl-tree topic page so that developers can more easily learn about it.
To associate your repository with the wavl-tree topic, visit your repo's landing page and select "manage topics."