office problem -- parsing input
office working on the test input
forgot infinity
another test case
and another
analyze the insertion sort with a heap
trying to make it iterative. not working yet

The issue is that the tree can get really imbalanced if the list is
already sorted. Deal with that!
html parsing
starting to implement a balanced BST
added rotate
working balanced tree
working on a million insertions
working totals
counting shifts
working on the first test input
works on huge test input!
some failing test cases :(
was forgetting to reset the parent of the moved children!

But we still have a balancing problem! More than one rotation is
necessary. See https://en.wikipedia.org/wiki/AVL_tree#Insertion
had a height bug, and now doing proper rotations
moving some code to test.py, important bugfixes, actual tests