def findInorderSucc(self, node, a):
        """ Returns inorder successor of any node """        
        self.lastSearchDepth = 0
        if node.isLeafNode():
            return node
        new_node = node.chooseChild(a + 1)
        return self.__nextSucc(new_node)
 Returns inorder successor of any node 
recipes/Python/577898_23_Tree/recipe-577898.py