from string import *
class BinaryNode:
    def __init__(self,value,left = None,right=None):
        self.value = value
        self.right = None
        self.left = None

class BinSearchTree:
    root = None
    def insert(self,value):
        self.root = self.put(self.root,value)

    def write(self):
        self.skriv(self.root)
        print

    def put(self,v,value):
        if v == None:
            v = BinaryNode(value)
            return v
        if value < v.value:
            v.left = self.put(v.left,value)    
        elif value > v.value:
            v.right = self.put(v.right,value)
        return v
            
    def skriv(self,v):
        if v == None:
            return True
        skriv(v.left)
        print v.value
        skriv(v.right)

    def exists(self,value):
        return self.finns(self.root,value)

    def finns(self,value,r):
        if r == None:
            return False
        elif 
        if value < r.value:
            return r.left
        elif value > r.value:
            return finns(value,r.right)
        else:
            return True
        #return False
            

