Binary Search Tree

BST.py

'''
A classic node class for use in a tree
'''
class Node:
    def __init__(self,data):
        self.left = None
        self.right = None
        self.data = data

'''
Creates a general Binary Tree
'''
class BinaryTree(Node):
    def __init__(self):
        self.root = None

    def insert(self, root, data):
        if root is None:
          root = Node(data)
        elif(data <= root.data):
          root.left = self.insert(root.left,data)
        elif(data > root.data):
          root.right = self.insert(root.right,data)
        return root