Simple binary search tree in python. Does not self balance.

binary_search_tree.py

class Node(object):
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

class BST(object):
    def __init__(self, root):
        self.root = Node(root)

    def insert(self, new_val):
        self._insert(self.root, new_val)

    def _insert(self, node, new_val):
        if new_val < node.value:
            if node.left == None: node.left = Node(new_val)
            else : self._insert(node.left, new_val)
        elif new_val > node.value:
            if node.right == None: node.right = Node(new_val)
            else: self._insert(node.right, new_val)
        return
            
    def search(self, find_val):
        return self._search(self.root, find_val)
    
    def _search(self, node, find_val):
        if node == None: return False
        if node.value == find_val: return True
        if find_val < node.value: return self._search(node.left, find_val)
        if find_val > node.value: return self._search(node.right, find_val)
        return False