Binary tree implementation, not binary search tree
Does someone have an implementation of binary tree, not binary search tree, i cannot find it on internet. Here is example how it should look. 

For example, if i have a array of integers from 1 to 7, i want to add them in the way i described down. In binary search tree, smaller elements are on the left and bigger are on the right, i want to make that every element can be placed everywhere

On binary tree it would be impossible to place number 2 in as the left child of 1 but in binary tree it should be possible

                 1

       2                     3


    4       5             6      7


Binary tree implementation, not binary search tree
===

Does someone have an implementation of binary tree, not binary search tree, i cannot find it on internet. Here is example how it should look. 

For example, if i have a array of integers from 1 to 7, i want to add them in the way i described down. In binary search tree, smaller elements are on the left and bigger are on the right, i want to make that every element can be placed everywhere

On binary tree it would be impossible to place number 2 in as the left child of 1 but in binary tree it should be possible

                 1

       2                     3


    4       5             6      7

