# BFS and DFS in Data Structure | Inorder, Preorder and Postorder Traversal with practical example.

Article by: Manish Methani

Last Updated: October 9, 2021 at 10:04am IST

Depth first Search (DFS) is used to traverse a tree in any of following three ways listed below :

```1) Inorder Traversal (Left - Root - Right)
2) Preorder Traversal (Root - Left- Right)
3) Postorder Traversal (Left - Right - Root)```

### Consider the following example for better visual illustration

DFS of given tree,

```1) Inorder Traversal :-  4 2 5 1 3 6
2) Preorder Traversal :- 1 2 4 5 3 6
3) Postorder Traversal :- 4 5 2 6 3 1
```

While traversing a tree you should divide parts into Left, Root, and Right which makes work easier while traversing. If tree contains more levels again divide them into Left-Root-Right. Then you can apply the DFS traversal with any of given three golden rules.

## Remember Golden Rules of DFS Traversal:-

```1) Inorder traversal (Left - Root - Right)
2) Preorder traversal (Root - Left- Right)
3) Postorder traversal (Left - Right - Root)```

Breadth First Traversal is also called Level Order Traversal in which you have to traverse level by level from root node.

`BFS of given tree is 1 2 3 4 5 6`

# Learn Flutter, FlutterFlow, Firebase & Angular.

Looking to learn how to create the production-ready apps
from scratch? Well, you are at the right place.

₹1299 or \$15.56

₹1299 or \$15.56

₹1299 or \$15.56

₹1299 or \$15.56

FREE

FREE

FREE

## C Programming Test

Test your C Programming skills with this comprehensive mock test on C Programming.

## Flutter Test

Solve most asked Interview Questions on Flutter and Test your foundational skills in flutter.

## GATE(CSE) Operating Systems

Solve most asked GATE Questions in Operating Systems and test your Gate Score.

## HTML,CSS Test

This is a mock test designed to help you assess your knowledge and skills in HTML and CSS.

## (GATE CSE) Data Structures & Algorithms Test

Solve most asked GATE Questions in Data Structures and Algorithms and test your Gate Score.