I have a binary search tree class and i need to write functions to peform on a binary search tree such as are two trees similar in structure, what is the height of Tree A, is Tree A perfect and the list goes on. I have figured that I need a list of trees in which trees is another class that has data members
name: to give the tree a specific name (this implementation is a binary search tree of integers) and bst: the tree associated with the name.
Can someone clarify that this is not a parallel structure.
Seems to me like you implement the tree class as a template, then you instantiate that template with the data class(es) of your choice.