Finish LCA constructor and implement destructor.
Add first rudimentary test for LCA queries.
Don't look for minimum between blocks if the two blocks are adjacent.
Add function that creates an array of pointers to nodes of the suffix tree.
Add test for node array creation.
Store pointers to nodes rather than node indices during the Euler tour.
Add method to verify calculated LCAs
Fix initialization of the block RMQ table for the remainder block.
Change Euler tour tests to handle the change from storing node indices to node pointers.
Add tests for LCA queries.