Database Reference
In-Depth Information
Figure A1-8b.
Detailed In-order Traversal Algorithm
Example 3:
Figure
A1-8c
provides an example of the application of the in-order
algorithm.
Figure A1-8c.
Example of In-order Traversal Algorithm
Post-order traversal
(also called suffix walk or reverse polish notation) obeys the
algorithm shown in Figures
A1-9a
and
A1-9b
.
Figure A1-9a.
Summarized Post-order Traversal Algorithm
