symmetric order traversal

views updated

symmetric order traversal (inorder traversal) A tour of the nodes of a binary tree obtained by using the following recursive algorithm: visit in symmetric order the left subtree of the root (if it exists); visit the root of the tree; visit in symmetric order the right subtree of the root (if it exists). Compare postorder traversal, preorder traversal.