Accoding to observation, we can find that
- the Tree is an in-complete heap
- every new number (x) in, just go through the right path of the HEAP, and find the first node whose value is less than (x)
- insert node(x) at the found place, and let the previous node to be x->left
- repeat step 2 and 3 until all numbers inserted
- the search in step 2 can be improved by binary search
The code will be posted here later.