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

    def add(self, data):
        if self.root is None:
            self.root = data
        else:


    def remove(self, data):
        pass

    def find(self, data):
        if self.root is None:
            print('Tree is empty')
            return None
        temp_root = self.root
        while


class BinaryTreeObj:
    def __init__(self, data):
        self.data = data
        self.link_to_root = None
        self.link_to_right = None
        self.link_to_left = None