Chapter 5 โครงสร้างข้อมูลแบบต้นไม้ (Tree Data...
31
Transcript of Chapter 5 โครงสร้างข้อมูลแบบต้นไม้ (Tree Data...
2
•
•
•
3
4
•••
5
•
•
10
R
MA
B C N P
D E
11
R
MA
B C N P R A M B C N P
[0] [1] [2] [3] [4] [5] [6]
12
R
MA
C P
R A M C P
[0] [1] [2] [3] [4] [5] [6]
R
MA
C P
13
14
R
A M
PNCB
A
B C
R
TL TR
A, B, C
Algorithm PreOrder (root)
Traverse a binary tree in node-left-right sequence.
Pre root is the entry node of a tree or subtree
Post each node has been processed in order
1 if (root is not null)
1 process (root)
2 preOrder (leftSubtree)
3 preOrder (rightSubtree)
2 end if
end preOrder
A
B C
R
TL TR
B, A, C
Algorithm inOrder (root)
Traverse a binary tree in left-node-right sequence.
Pre root is the entry node of a tree or subtree
Post each node has been processed in order
1 if (root is not null)
1 inOrder (leftSubtree)
2 process (root)
3 inOrder (rightSubtree)
2 end if
end inOrder
A
B C
R
TL TR
B, C, A
Algorithm postOrder (root)
Traverse a binary tree in left-right-node sequence.
Pre root is the entry node of a tree or subtree
Post each node has been processed in order
1 if (root is not null)
1 preOrder (leftSubtree)
2 preOrder (rightSubtree)
3 process (root)
2 end if
end postOrder
R
MA
B C P
R
MA
B C P
26
27
R
MA
B C P
R
MA
B C PX
M
28
R
MA
B C P
R
MA
B C P
L
x
29
30
Q & A
31
