binaryTree.py

class BinaryTree:
  def __init__(self,rootObj):
    self.key = rootObj
    self.leftChild = None
    self.rightChild = None
    
  def getRightChild(self):
    return self.rightChild
    
  def getLeftChild(self):
    return self.leftChild
    
  def getRootVal(self):
    return self.key
    
  def setRootVal(self,obj):
    self.key = obj
    
  def insertLeft(self,newNode):
    if self.leftChild == None:
      self.leftChild = BinaryTree(newNode)
    else:
      temp = BinaryTree(newNode)
      temp.leftChild = self.leftChild
      self.leftChild = temp
      
  def insertRight(self,newNode):
    if self.rightChild == None:
      self.rightChild = BinaryTree(newNode)
    else:
      temp = BinaryTree(newNode)
      temp.rightChild = self.rightChild
      self.rightChild = temp