二叉树BinaryTree

class BinaryTree:
    def __init__(self,data):
        self.key = data
        self.leftChild = None
        self.rightChild = None

    def insertLeft(self,childdata):
        if self.leftChild == None:
            self.leftChild = BinaryTree(childdata)
        else:
            temp = BinaryTree(childdata)
            temp.leftChild = self.leftChild
            self.leftChild = temp

    def insertRight(self,childdata):
        if self.rightChild == None:
            self.rightChild = BinaryTree(childdata)
        else:
            temp = BinaryTree(childdata)
            temp.rightChild = self.rightChild
            self.rightChild = temp

    def getRightChild(self):
        return self.rightChild

    def getLeftChild(self):
        return self.leftChild

    def setRootVal(self,value):
        self.key = value

    def getRootVal(self):
        return self.key