From In-order Output to Build the Tree
•Take In-order Traversal Output Data
•And Build the Tree
•Take the middle (N) or so as the root
•Keep going/taking alternate left (nodeLabels) (K D) from there
•Make those also roots/parents (left sub tree)
•The last may be at the last left in this flow
•Then from the last (left last of data)
•Take alternate nodeLabels (P, E) and make them the right child (in left side tree)
•From middle Keep going/taking alternate right node labels (A L)
•Make center/parent/root (right subtree)
•From the end reverse back with the alternate nodes (T F)
•Make these as left children
•
