Recursively walk through the C_stree, starting from node
            <astr_startPath> and using the internal l_allPaths space
            as verifier.

            To self-discover tree structure based on internal node links,
            use treeExplore() instead.

            The <afunc_nodeEval> is a function that is called on a node
            path. It is of form:

                afunc_nodeEval(astr_startPath, **kwargs)

            and must return a dictionary containing at least one field:

                { "status": True | False }

            This same dictionary is also returned out to the caller of this
            function.

def treeRecurse(self, afunc_nodeEval = None, astr_startPath = '/'):
            """
            Recursively walk through the C_stree, starting from node
            <astr_startPath> and using the internal l_allPaths space
            as verifier.

            To self-discover tree structure based on internal node links,
            use treeExplore() instead.

            The <afunc_nodeEval> is a function that is called on a node
            path. It is of form:

                afunc_nodeEval(astr_startPath, **kwargs)

            and must return a dictionary containing at least one field:

                { "status": True | False }

            This same dictionary is also returned out to the caller of this
            function.

            """
            ret = {'status': False}
            [b_valid, l_path ] = self.b_pathInTree(astr_startPath)
            if b_valid and afunc_nodeEval:
                ret = afunc_nodeEval(astr_startPath)
            b_OK = ret['status']
            #print 'processing node: %s' % astr_startPath
            if b_OK:
                for node in self.lstr_lsnode(astr_startPath):
                    if astr_startPath == '/': recursePath = "/%s" % node
                    else: recursePath = '%s/%s' % (astr_startPath, node)
                    self.treeRecurse(afunc_nodeEval, recursePath)
            return ret