1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
from ete3 import Tree
t = Tree( '(A:1,(B:1,(C:1,D:1):0.5):0.5);' )
# Visit nodes in preorder (this is the default strategy)
for n in t.traverse():
print(n)
# It Will visit the nodes in the following order:
# /-A
# ---------|
# | /-B
# \--------|
# | /-C
# \--------|
# \-D
# --A
# /-B
# ---------|
# | /-C
# \--------|
# \-D
# --B
# /-C
# ---------|
# \-D
# --C
# --D
# Visit nodes in postorder
for n in t.traverse("postorder"):
print(n)
# It Will visit the nodes in the following order:
# --A
# --B
# --C
# --D
# /-C
# ---------|
# \-D
# /-B
# ---------|
# | /-C
# \--------|
# \-D
# /-A
# ---------|
# | /-B
# \--------|
# | /-C
# \--------|
# \-D
|
