What is logic to construct a binay Tree? : I have a while which continuously takes integers until -1 entered. And those elements must be inserted into binary tree (Not BST). If BST we have a conditon to where to insert node. But how can I construct binay tree?
I mean if nodes are 1,2,3,4,5,6...... 
1 is root, 2,3 are left and right childs of node 1.
4,5 are left and right childs of node 2. And 6 is left child of 3...like this

I am basic learner. Help me in this.