Way to implement of traversal of a binary tree

Question

What is the way to implement of traversal of a binary tree?

Answer 1

Binary tree traversal is a process of visiting each and each node of the tree. The basic binary tree traversals are as ‘depth-first’ and ‘breadth-first’.

Breadth-first traversal:

It is the ‘level-order traversal’. This level-order traversal does not obey the branches of the tree. The FIFO (first-in first-out) queue is required to traversal into level-order traversal.

The depth-first traversal is categorized within three kinds, namely as: pre-order, post-order and in-order.

Pre-order: This traversal includes visiting the root node first, after that traversing the left sub tree and at last the right sub tree.

In-order: This traversal comprises visiting the left sub tree first, after that visiting the root node and at last the right sub tree.

Post-order: This traversal comprises visiting the left sub tree first, after that visiting the right sub tree and at last visiting the root node.