Inorder traversal program in c plus plus?

Answer 1

In-order traversal relates to non-empty binary trees which can be traversed in one of three ways: pre-order, in-order and post-order. The current node is always regarded as being the root of the traversal, and all operations occur recursively upon that root.

Pre-order:

1. Visit the root.

2. Traverse the left sub-tree.

3. Traverse the right sub-tree.

In-order:

1. Traverse the left sub-tree.

2. Visit the root.

3. Traverse the right sub-tree.

Post-order:

1. Traverse the left sub-tree.

2. Traverse the right sub-tree.

3. Visit the root.