OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Tree traversal

Index Mathematics Fields of mathematics Applied mathematics Algorithms Graph algorithms
 1 By others on same topic  0 Discussions  1970-01-01  See my version

 Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Index

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Tree traversal by Ciro Santilli 37  Updated 2025-05-13  +Created 1970-01-01
 View more
The summary from www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/ is a winner:
    1
   / \
  2   3
 / \
4   5
  • inorder DFS: 4 2 5 1 3
  • preorder DFS: 1 2 4 5 3
  • postorder DFS: 4 5 2 3 1
  • breadth-first search: 1 2 3 4 5
In principle one could talk about tree traversal of unordered trees as a number of possible traversals without a fixed order. But we won't consider that under this section, only deterministic ordered tree traversals.
 Read the full article
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook