Data Structure for ordered binay tree
I am working on a project in which I need to create an ordered binary tree and then map a library of 7 sub trees to the main tree to cover it. The structure of the main tree and labeling the nodes are all that is important for now - I will add data later to each node. A binary search tree is not applicable. I will need to create the main tree, add nodes in specific location on the tree (each node can have 1 or 2 children), label each node so that I can traverse the tree easily, compare the tree with the library sub trees (from the leaves up to the root).
Can someone help with a starter code where I can do the above and I will add methods to do the calculations I need. Thanks.