Binary trees

[hunkeelin]

if given a set of numebrs what do u mean by assuming in orderly property?
e.g
assume the follow values are to be entered into a binary teee that is to have the ordering property: 45 23,43 66, 3, 1, 3

can someone explain to me the answer for
inorder:
preorder:
postorder:
and why is like that? (i know what are those 3 terms but whenever i am given a set of numbers addressing it in "ordering property" i am just lost)