I'm going through some past exam papers for my course and I'm having trouble completing this one question.
It is as follows: "Draw a strict binary tree with seven nodes that has the same pre-order and post-order traversal sequence".
Is this actually possible? Wouldn't I need to visit the root node before anything else for both sequences, that isn't possible with post-order traversal in a strict binary tree right? Unless the tree consisted of a single node?
I assume I'm missing something obvious. Post-order = LRN, Pre-order = NLR.