Technology: Java, Eclipse

This project shows the implementation of a tree data structure with the parent and
child node objects being connected through the fields in the nodes. There are functions
like contains() which returns true if an input node is in the tree, and prefix() which
has a sequence of nodes as an input and returns an array of the longest occurrence of
the sequence in the tree.

EntryTree.java (click on image to download file):

Dictionary.java (click on image to download file): An example of how the tree could be used

Output of Dictionary.java: