Hello,(adsbygoogle = window.adsbygoogle || []).push({});

There are three different orders of traversal that we learned about

##\bullet## pre-order traversal

##\bullet## in-order traversal

##\bullet## post-order traversal

Anyone know of any easy ways of remembering these 3 and how to order them? I have posted my lecture slides, but I could imagine the tree looking differently and then not knowing how to adapt and analyze how the calls would be made to a different looking tree.

Also, when one writes a recursive program, which order of traversal is taken? Is there some sort of default? Why are there 3 ways of traversing?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Trees as Data Structures

Loading...

Similar Threads - Trees Data Structures | Date |
---|---|

C/++/# 3d space filling tree | Apr 5, 2017 |

Minimum Spanning Tree in R | Mar 3, 2017 |

Different Node Deletion/Insertion in a Binary Search Tree | Oct 23, 2016 |

Data structures (trees) | Apr 21, 2016 |

I need help about data structures (trees) in java | Feb 11, 2006 |

**Physics Forums - The Fusion of Science and Community**