Jump to content

Inorder traversal

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Poor Yorick (talk | contribs) at 08:33, 8 April 2003 (someone correct me if i'm wrong....). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In Computer science, Inorder traversal is used in Data structures, and specifically, Trees and Binary Trees.

Steps to Inorder Traversal

Given a non-empty tree,

1. Process the nodes in the left subtree with a recursive call 2. Process the root 3. Process the nodes in the right subtree with a recursive call

Given a binary tree PY:

File:TreePY.gif

The order would go D,B,G,E,A,C,F


Compare: Pre-order traversal, post-order traversal

Retrieved from "https://en.wikipedia.org/w/index.php?title=Inorder_traversal&oldid=811077"