binary tree preorder traversal?

Draw a binary tree that produces the preorder traversal for the nodes in the following order:

63, 958, 911, 221, 246, 977, 91, 42, 285, 715, 429, 199, 52.

If any one could help me with this I would be very greatful. I have spent the morning trying to understand this concept just not with this list of nodes and would like to see someone else's way of listing these nodes.

Thank you.

1 Answer

  • Cronin
    Lv 6
    8 years ago
    Favorite Answer

    Preorder is root, left child, right child...

    You can literally draw a tree where every successive number is a left child of its' parent and it's technically a correct answer.

Still have questions? Get your answers by asking now.