def remove(self,key):
        value = MyComparableKey(key,None)
        node = self._recur(value,self.root)
        if node != None:
            if node.right != None:
                minimum = self._minValue(node.right)
                temp = node
                node = minimum
                node.right = temp.right
                node.left = temp.left

            else:
                if node.left == None:
                    node = None
                else:
                    temp = node
                    node = node.left
                    node.right = temp.right
                    node.left = temp.left

        else:
            raise NotFoundException