python Btree

class Btree(object):
    def __init__(self,value):
        self.left = None
        self.data = value
        self.right = None
        self.deep = None
    def insert_left(self,value):
        self.left = Btree(value)
        return self.left
    def insert_right(self,value):
        self.right = Btree(value)
        return self.right
    def show(self):
        return self.data

# nl = 1
# nr = 1
class BtreeSearch(object):
    # def __init__(self,node):
    #     self.node = node
        
    def pre_search(self,node):
        # global nl,nr
        # if self.node != None:
        print(node.show(),node.deep)
        if node.left != None:
            # nl = nl + 1
            node.left.deep = node.deep + 1
            self.pre_search(node.left)
        if node.right != None:
            # nr = nr + 1
            node.right.deep = node.deep + 1
            self.pre_search(node.right