def __insert(self, ins_at_node, ptr, wLst, path_cnt):

        path = ''
        tot_nodes_added = 0
        patt_len = len(wLst)
        for pos in range( ptr, patt_len ):
            str_label = wLst[pos]
            if pos == patt_len - 1: path = ' '.join( wLst[0:pos] )
            else: path = ' '.join( wLst[0:pos+1] )
            child_node = SuffixTreeNode(ins_at_node, str_label, path, ins_at_node.__node_depth + 1, path_cnt)
            ins_at_node.__childIndxDict[str_label] = child_node
            tot_nodes_added += 1
            ins_at_node = child_node

        return tot_nodes_added
Inserts a node at the specified position in the tree, returns # of new paths created
dataset/ETHPy150Open sfu-natlang/Kriya/src/Kriya-Grammar-Xtrctr/myTrie1.py/SuffixTreeNode.__insert