Results can only be achieved if you have the focused direction and crystal clear knowledge. To achieve this, you need a mentor. We will help you out by connecting with an expert mentor in the field.Learn More
1 min 30 sec read
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)
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.
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
Easy to use online data structure compiler where you can execute the programs in your favourite programming language.
(C, C++, Python)