Ask your own question, for FREE!
Computer Science 12 Online
OpenStudy (anonymous):

if you have a binary tree with at least 3 nodes, using pre order, post and in order, can it be written the same way?

OpenStudy (anonymous):

nope. All three are different.

OpenStudy (anonymous):

ahhh, now your question from a few days ago makes sense... A tree with only one node has the same traversal order in pre and in and post orders. Any other tree will have different results for the three types of traversals.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!