Reorganize the Euler tour part of the LCA algorithm. Also, create an array of the tour itself.
Reorganize Euler tour tests.
Delete moved tests.
Edit the the block RMQ database so it can handle the remainder block.
Clean up remainder block table.
Clean up block arrays after tests.
First draft of actual lowest common ancestor methods.