Preorder and Postorder Traversal of Rooted Trees

Many algorithms that make use of trees often traverse the tree in some order, that is, they visit each vertex in a systematic way. Two commonly used traversals are preorder and postorder. A preorder traversal of is defined by a two-step recursion:
1. visit the root and
2. visit in preorder the subtrees of the root of from left to right.
A postorder is similarly defined as:
1. visit in postorder the subtrees of from left to right and
2. visit the root.
This Demonstration shows the preorder and postorder traversals corresponding to a randomly labeled rooted tree with a chosen number of vertices.

THINGS TO TRY

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

RELATED LINKS

    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.