Show Summary Details

Quick Reference

A path through a graph in which every vertex is visited at least once. Traversals are usually discussed in connection with special kinds of graphs, namely trees. Examples include preorder traversal, postorder traversal, and symmetric order (or inorder) traversal. When parse trees for arithmetic expressions are traversed, these tree traversals lead to prefix (Polish) notation, postfix (reverse Polish) notation, and infix notation respectively.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.