Binary Search Tree

import random

class TreeNode:
    def __init__(self, key):
        self.key = key
        self.left = None
        self.right = None
        self.p = None

class BinaryTree:
    def __init__(self):
        self.root = None

    def length(self):
        return self.size

    def inorder(self, node):
        if node == None:
            return None
        else:
            self.inorder(node.left)
            print node.key,
            self.inorder(node.right)

import random

class TreeNode:

def __init__(self, key):

self.key = key

self.left = None

self.right = None

self.p = None

class BinaryTree:

def __init__(self):

self.root = None

def length(self):

return self.size

def inorder(self, node):

if node == None:

return None

else:

self.inorder(node.left)

print node.key,

self.inorder(node.right)