how to design a generic binary tree?

See more:

Python

algorithm

Hi everyone,

As I understand there are two kinds of binary trees:
1. Binary search trees (BST) and
2. Generic Binary trees

I am looking for implementing a generic binary tree in python. I am mainly looking at designing and implementing the insertion operation in the generic binary tree.

For Example :

# input is a list
L = [1,2,3,4,5,6,7,8,9]

# I expect the output to be a tree

'''
            1   
           / \
          /   \
         2     3
        / \   / \
       /   |  |  \
      4    5  6   7
     / \
    /   \
   8     9

'''
# I don`t want it to be printed in this manner, but I expect some data structure which stores the generic binary tree in this fashion. 

Thanks in advance !