DFS in Binary tree

DFS (Depth First Search ) − It is a tree traversal algorithm that traverses the structure to its deepest node. There are three most used methods that are used to traverse the tree using DFS. it goes into depth of each node as the root node and then goes to the next one

To understand the Depth-first search in the Binary tree, we first need to know why it is called the Depth-first search.

A binary tree is a hierarchical representation of nodes carrying data. Each node contains three fields, one for storing value which we would pass eventually, and the other two fields store address of the left and right child nodes.

Just like every hierarchical structure, the tree also has one reference point. We call it root, which is the topmost node of the tree and has no parent node. In Binary tree, the root has at most two child nodes.

If you noticed already, the tree is not a linear data structure, we cannot access nodes by indexing as we do in linear data structures(Array, List, Stack).

Then, how we would ever explore this complex-looking structure?

Here, tree traversal algorithms come to rescue. There are mainly two types of techniques we use to traverse a binary tree.

DEPTH FIRST SEARCH

BREADTH FIRST SEARCH

As the name implies, DFS traverse a tree by going in-depth recursively till it can and then backtracking to previously visited node. While BFS traverse a tree level by level.

Imagine, you are in a maze game, you pick one road, mark that one visited so that you don't visit it twice and, explore till you find the endpoint. Once you reach the endpoint, you go back to the previously visited road and start exploring from that point, repeat the procedure till you find the escape.

Well, DFS works exactly the same way.

There are three types of DFS in Tree

• Preorder
• Inorder
• Postorder

Preorder:- Parent →Left →Right

Inorder:- Left →Parent →Right

datastrucutre coding algorithms python

In this tutorial, you’re going to learn a variety of Python tricks that you can use to write your Python code in a more readable and efficient way like a pro.

Today you're going to learn how to use Python programming in a way that can ultimately save a lot of space on your drive by removing all the duplicates. We gonna use Python OS remove( ) method to remove the duplicates on our drive. Well, that's simple you just call remove ( ) with a parameter of the name of the file you wanna remove done.

In the programming world, Data types play an important role. Each Variable is stored in different data types and responsible for various functions. Python had two different objects, and They are mutable and immutable objects.

How To Plot A Decision Boundary For Machine Learning Algorithms in Python, you will discover how to plot a decision surface for a classification machine learning algorithm.

Magic Methods are the special methods which gives us the ability to access built in syntactical features such as ‘<’, ‘>’, ‘==’, ‘+’ etc.. You must have worked with such methods without knowing them to be as magic methods. Magic methods can be identified with their names which start with __ and ends with __ like __init__, __call__, __str__ etc. These methods are also called Dunder Methods, because of their name starting and ending with Double Underscore (Dunder).