Ok so this is my task:
Create a generic class called GenBinTree. GenBinTree will use nodes
that store a value of the generic type to store its contents.
This tree will not be a search tree (no ordering of nodes by value).
What ges me its the the part that says it will not be a search tree, from what i see dont get how a tree can be a tree withouth being a search tree, I do not understand how to implement a tree with the given criteria.