In almost-union-find is a proposed solution to the kattis problem Almost Union-Find. NOTE: If you have an issue with this Kattis problem it might be due to the input file. Seems like it can put some empty lines in the begining of the input that can mess you up. Atleast I only changed how I did input and it suddenly began working.
In the other folder, binary-tree, is an implementation of an AVL tree complete with test.
- Clone repo
- Navigate into either
almost-union-findorbinary-treedepending on which one you want to run. - For
almost-union-findruncargo runin repo directory - For
binary-treeruncargo testin repo directory to run tests