def printTree(self, root_node):
        '''Use DFS algorithm to print the tree'''

        tot_nodes = 0
        nodesVisited = []
        nodesVisited.append( root_node )
        while nodesVisited:
            curr_node = nodesVisited.pop()
            for child_label in curr_node.__childIndxDict.keys():
                if child_label in "$$$":
                    # @type child_label SuffixTreeNode
                    print "Path : ", child_label.label_path
                    tot_nodes += 1
                    continue
                child_node = curr_node.__childIndxDict[child_label]
                nodesVisited.append( child_node )

        print "Total nodes in Trie :", tot_nodes
        return None
dataset/ETHPy150Open sfu-natlang/Kriya/src/Kriya-Grammar-Xtrctr/myTrie1.py/SuffixTreeNode.printTree/operator `==` -> `in`