class binTree:
    class treeNode:
        def __init__(self, data):
           self.key = data
           self.left = None
           self.right = None
    #------------------------------------
    def __init__(self):
        self.root = None
        self.size = 0
    #------------------------------------
    def isEmpty(self):
        
    #------------------------------------
    def treeSize(self):
       
    #------------------------------------
    def insertNode(self, newNode):
        
    #---------------------------------------
    def inorder(self, nodePtr):
       
    #--------------------------------------
    def postorder(self, nodePtr):
       
    #-------------------------------------

    def preorder(self, nodePtr):
       
    #--------------------------------------
    def findMin(self):
        
    #--------------------------------------
    def findMax(self):
        
    #---------------------------------------
    def searchKey(self, searchItem):
       
    #--------------------------------------
    def deleteNode(self, item):
                   
            
    #--------------------------------------
    def findForDelete(self, item, found, locPtr, parent):
        
    #---------------------------------------




        
         
    











            
                    
    
