Finding two trees with the same post- and preorder

Asked Jun 06 '20 at 12:49

Active Jun 06 '20 at 12:49

Viewed 60 times

I am looking for two different search trees with at least 4 nodes. The trees don't have to have the general search tree attributes.

The postorder and preorder from tree A has to be the same as the post- and preorder of tree B.

I don't really understand how to do that so that both trees are not identical.

Grateful for any hints.

asked Jun 06 '20 at 12:49

Johnnb

Show some code and explain where the code doesn't work. – Raymond Chen Jun 06 '20 at 13:10
This is a theoretical question. Nothing about code. – Johnnb Jun 06 '20 at 13:13
Then show some pseudocode. How would you search a tree to find two subtrees that have the same post- and pre-order? (Or presumably return `false` if no two such subtrees exist.) – Raymond Chen Jun 06 '20 at 13:14

0 Answers0