树深度优先搜索

depth_first_search.py

#!/usr/bin/env python

__author__ = 'caoxudong'

from datastructure.common_datastructure import node

def visit_node(node):
  print(node.data)

def depth_first_search(root=node.Node):
  if root:
    stack = []
    stack.append(root)
    while len(stack):
      temp_node = stack.pop()
      visit_node(temp_node)
      if temp_node.children and len(temp_node.children) > 0:
        for e in temp_node.children:
          stack.append(e)

if __name__ == '__main__':
  root = node.Node
  depth_first_search(root)