Database Reference
In-Depth Information
Figure A1-7b. Detailed Pre-order Traversal Algorithm
Example 2: Figure A1-7c provides an example of the application of the
pre-order algorithm.
Figure A1-7c. Example of Pre-order Traversal Algorithm
In-order traversal (also called symmetric order or infix notation) obeys the
algorithm shown in Figures A1-8a and A1-8b .
Figure A1-8a. Summarized In-order Traversal Algorithm
 
Search WWH ::




Custom Search