rootPointer = -1
class Node():
    def __init__(self, leftPointerP=-1, itemP=0, rightPointerP=-1):
        self.item = itemP
        self.leftPointer = leftPointerP
        self.rightPointer = rightPointerP
BinaryTree = [ Node() for i in range(10)]
for i in range(10):
    print(BinaryTree[i].item)
def find(itemSearched):
    currentPointer = rootPointer
    while(currentPointer != -1):
        if itemSearched < BinaryTree[currentPointer].item:
            currentPointer = BinaryTree[currentPointer].leftPointer
        elif itemSearched > BinaryTree[currentPointer].item:
            currentPointer = BinaryTree[currentPointer].rightPointer
        elif itemSearched == BinaryTree[currentPointer].item:
            return currentPointer, True
    return -1, False
print(find(7))