How do I save a binary tree to an array of in-order traversal?
Answers
Answered by
1
If you have both of these, you can get back the tree structure as such: In pre-order sequence, first node is root of tree, i.e. A. All nodes left of A in the in-order sequence is in the left subtree of A(i.e. DBE) and the rest are in the right subtree(i.e.
Similar questions