Iniital commit.
Need to refactor CrackingTheCodingInterviewSolutions.java
MinHeap initial version committed.
Added unit tests for MinHeap.
Added comments for trie.
SinglyLinkedList committed.
Added comments to Trie.java
Chapter 2 committed.
Stack committed. Chapter 3 refactored...
... and committed.
Two implementations of queues committed.
Chapter 1 refactored and committed.
DoublyLinkedList committed.
Queue on doubly linked list committed.
Adding eclipse files to source control.
Suffix tree implementation partially complete.
Need to debug!
More work on suffix tree.
Added JUnit for Suffix Tree. Looks good!
Chapter 9 solutions refactored.
Renamed some packages.
Chapter 5 refactored and committed.
Added finding palindromes using suffix trees.
Modified suffix trees to permit least common ancestor searches (added a
depth field to each node and added the LCA algorithm).
Committing O(n)-space version of suffix tree. Updated Readme.
Ukkonen's algorithm partially implemented.
More work on Ukkonen's algorithm.
Rewrite of Ukkonen's algorithm to fix several bugs.
Suffix links and unspeeded up insertion working okay.
Further bugfixes. Implicit suffix tree looks good now.
Suffix links implemented. Many bugfixes.