fork download
  1. #!/usr/bin/env python3
  2.  
  3. def DFS(tree):
  4. left, right = 0, 1
  5. def preorder(v):
  6. if tree[v] == []:
  7. print(v)
  8. else:
  9. preorder(tree[v][left])
  10. print(v)
  11. preorder(tree[v][right])
  12. return preorder(0)
  13.  
  14. if __name__ == '__main__':
  15. tree = [[1, 2], [3, 4], [5, 6], [7, 8], [9, 10], [11, 12], [13, 14],
  16. [], [], [], [], [], [], [], []]
  17. DFS(tree)
Success #stdin #stdout 0.02s 9168KB
stdin
Standard input is empty
stdout
7
3
8
1
9
4
10
0
11
5
12
2
13
6
14