Here you will learn about tree traversal with program example.

**Tree** is a subset of Graph data structure where the number of edges are exactly one less than the number of vertices (nodes). We can call any graph a tree if it does not have any cycle (closed loop).

**Tree traversal** refers to the process of visiting each node of the tree at least once. Unlike basic linear data structures like arrays, linked list, stack and queue where there was only one way of traversing, trees can be traversed in different ways.

We can categorize the tree traversal into two categories:

- Breadth-first Traversal
- Depth-first Traversal

## Depth-first Traversal

In Depth-first traversal, the direction of traversal is from top to bottom. As the name suggests, we traverse to the depth of the tree starting from the root node of the tree. Based on the way of traversal, we have these three types of traversals:

- In-order Traversal
- Pre-order Traversal
- Post-order Traversal

These three types of traversal are usually performed on binary trees. Binary tree is a special type of tree in which a parent node can have at most two child nodes. Binary Search Tree (BST) is a special binary tree where every smaller value is on the left of the parent node and every greater value is on the right of the parent node.

Let’s see these traversals in detail.

### In-order Traversal

As the name suggest, in in-order traversal we traverse the tree in the order that we humans normally use. We first visit the left subtree after that we visit the parent of the left subtree and then we visit the right subtree. When we use in-order traversal on a Binary Search Tree (BST), we get the data in sorted order (ascending order).

**Algorithm for In-order Traversal**

*Check that the current node is not null, if null return to the previous call.**Make recursive call to the in-order function for traversing the left subtree.**Print the value of the current node.**Make recursive call to the in-order function for traversing the right subtree.*

### Pre-order Traversal

Pre-order traversal is the type of traversal in which we first visit the root node of the tree. After the root node, we visit the left subtree and finally we visit the right subtree. The Pre-order traversal is mainly used to create a copy of the existing tree. It is also used in the evaluation of expressions, for example: we can create a prefix form of an expression using the pre-order traversal.

**Algorithm for Pre-order Traversal**

*Check that the current node is not null, if null return to the previous call.**Print the value of the current node.**Make recursive call to the pre-order function for traversing the left subtree.**Make recursive call to the pre-order function for traversing the right subtree.*

### Post-order Traversal

In Post-order Traversal, the tree is traversed in the order of left->right->root. That means we first visit the left subtree after that we visit the right subtree and finally we visit the root node. The Post-order traversal is used during deletion of the tree. It is suitable for deletion operation because it first deletes the child nodes then it deletes the parent node.

**Algorithm for Post-order Traversal**

*Check that the current node is not null, if null return to the previous call.**Make recursive call to the post-order function for traversing the left subtree.**Make recursive call to the post-order function for traversing the right subtree.**Print the value of the current node.*

## Breadth-first Traversal

The Breadth-first traversal is usually used in graphs but not commonly used in trees. It is also called **Level-order traversal**. When we traverse a tree using level-order traversal, we visit all the nodes of tree level by level. We first visit all the nodes of the current level before visiting the nodes of the next level. The number of nodes keeps increasing as we go to the next level, so the name breadth-first traversal is given as the breadth keep broadening as we traverse the height of the tree.

**Implementation of the In-order, pre-order & post-order Traversal in C++**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 |
#include<bits/stdc++.h> using namespace std; /* Creating structure for nodes */ struct node { int value; node *left,*right; }; /* creating a class to manage the binary tree */ class btree { void insert(int,node*); // private member function public: node *root; btree(); //constructor ~btree(); //destructor void insert(int); void inorder(node*); void preorder(node*); void postorder(node*); }; btree::btree() { root=NULL; // intializing the root } btree::~btree() { cout<<"\nDestructor executed!!"; } void btree::insert(int key) { if(!(root==NULL)) { /* if the tree is not empty */ insert(key,root); } else { /* if tree is empty */ root=new node; root->value=key; root->left=NULL; root->right=NULL; } } /* preserving the properties of binary tree */ void btree::insert(int key,node *leaf) { if(key<leaf->value) { if(leaf->left==NULL) { leaf->left= new node; leaf->left->value=key; leaf->left->left=NULL; leaf->left->right=NULL; } else { insert(key,leaf->left); } } else { if(leaf->right==NULL) { leaf->right= new node; leaf->right->value=key; leaf->right->left=NULL; leaf->right->right=NULL; } else { insert(key,leaf->right); } } } /* recursive implmentation of in-order traversal*/ void btree::inorder(node *leaf) { if(leaf!=NULL) { inorder(leaf->left); cout<<leaf->value<<" "; inorder(leaf->right); } } /* recursive implmentation of pre-order traversal*/ void btree::preorder(node *leaf) { if(leaf!=NULL) { cout<<leaf->value<<" "; preorder(leaf->left); preorder(leaf->right); } } /* recursive implmentation of post-order traversal*/ void btree::postorder(node *leaf) { if(leaf!=NULL) { postorder(leaf->left); postorder(leaf->right); cout<<leaf->value<<" "; } } int main() { btree b; // creating object of class int arr[]={10,6,12,3,8,11,14,5}; for(int i=0;i<8;i++) b.insert(arr[i]); //inserting values /* call to inorder traversal*/ cout<<"The inorder traversal is : "; b.inorder(b.root); /* call to preorder traversal*/ cout<<"\nThe preorder traversal is: "; b.preorder(b.root); /* call to postorder traversal*/ cout<<"\nThe postorder traversal is: "; b.postorder(b.root); return 0; } |

**Output:**

*The inorder traversal is : 3 5 6 8 10 11 12 14 *

*The preorder traversal is: 10 6 3 5 8 12 11 14 *

*The postorder traversal is: 5 3 8 6 11 14 12 10 *

*Destructor executed!!*

Comment down below if you have any queries related to tree traversal.