| | | | | |

Tree Traversals - 3

Review:

  • Preorder: depth first search (possibly stack based), visit on arrival
  • Postorder: depth first search (possibly stack based), visit on departure
  • Levelorder: breadth first search (queue based), visit on departure

| | Top of Page | 9. Trees 1: Theory, Models, Generic Heap Algorithms, Priority Queues - 7 of 22