I am trying to get a good understanding of what's happening in the following question:

~Given the following numbers in array A ...

47 43 20 24 32 44 35

... what are the numbers that would result from a Pre-Order Traverssal of the Binary Tree built using the above numbers. Hint: draw the tree.

47 43 20 24 32 35 44 <---- THIS IS THE ANSWER

I have drawn many trees thus far and I am confused as to how nodes are inserted. Are they inserted in a particular order every time? Or are there different ways? I know 47 is root, then there will be 2 child trees under root. What should the tree look like?