Database Reference
In-Depth Information
Figure A1-6.
Binary Tree Algorithms (continued)
A1.2.6 Binary Tree Traversals
There are three traversal algorithms for binary trees: Pre-order, In-order and Post-order.
Pre-order traversal
(also called prefix walk or polish notation) obeys the algorithm
shown in Figures
A1-7a
and
A1-7b
.
Figure A1-7a.
Summary of the Pre-order Traversal Algorithm
