logo CodeStepByStep logo


Language/Type: C++ binary trees tree traversals
Author: Marty Stepp (on 2016/08/27)

Write the elements of the tree below in the order they would be seen by a pre-order, in-order, and post-order traversal.

(42 (15 / (27 (48))) (9 (86 / (12 (5))) (3 / (39))))

You must log in before you can solve this problem.

Log In

Need help?

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.