A

MICRO PROJECT ON
DSU:
ON

PROJECT TITLE BY

“TREE”
SUBMITTED BY -
Sr. No. Name of Student Roll No.
01 SHIVAM ANIL SHINGADE CM2119
02 VIJAY ANIL SHINDE CM2126
03 AJAY GURUBASU SHIVSHARAN CM2127
04 GAYATRI SADASHIV LAD CM2129
05 AARTI ANANDRAO PAWALKAR CM2130

UNDER THE GUIDENCE:

NAME OF GUIDENCE: M.J.KHANDAGLE MAM

Academic Year
2021-2022

DEPARTMENT OF COMPUTER TECHNOLOGY

Loknete Hon. Hanmantrao Patil Charitable Trust’s
ADARSH INSTITUTE OF TECHNOLOGY (POLYTECHNIC), VITA, DIST-SANGLI
 Loknete Hon. Hanmantrao Patil Charitable Trust’s
Adarsh Institute of Technology (Polytechnic), Vita

CERTIFICATE
This is to certify that the micro project report entitled

“TREE”
Submitted by

Name of Student Roll No.

01 Shivam Anil Shingade CM2119

02 Vijay Anil Shinde CM2126

03 Ajay Gurubasu Shivsharan CM2127

04 Gayathri Sadashiv Lad CM2129

05 Aarti anandro pawalkar Cm2130

For Third Semester of Diploma in Computer Technology of course Data structure c (22317) for
academic year 2020-2021 as per MSBTE, Mumbai curriculum of ‘I’ scheme.
DIPLOMA OF ENGINEERING
(COMPUTER TECHNOLOGY)

SUBMITTED TO
MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION MUMBAI
ACADEMIC YEAR 2021-22

NAME OF GUIDE HEAD OF DEPARMENT PRINCIPLE

M.J.KHANDAGLE MAM PROF. A.A.VANKUNDRE PROF.D.K.MAHADHIK
 ACKNOWLEDGEMENT

I express my sincere gratitude to MISS. _M.KHANDAGLE MAM, Department of Computer Technology,

for his/her stimulating guidance, continuous encouragement and supervision throughout the course of
present work.

I would like to place on record my deep sense of gratitude to Prof.A.A.Vankudre HOD-Department of

Computer Technology, for his generous guidance, help and useful suggestions.

I am extremely thankful to Principal Prof.D.K.Mahadik for this motivation and providing me

infrastructural facilities to work in, without which this work would not have been possible.

I would like to express my gratitude to all my colleagues for their support, co-operation and fruitful
discussions on diverse seminar topics and technical help.

Name of Student Sign (12pt)

1.Shivam Anil Shingade
2.Vijay Anil Shinde
3.Ajay Gurubhasu Shivsharan

4.Gayathri Sadashiv Lad

5.Aarti Anandraom Pawalkar

Tree Traversal:
Traversal is a process to visit all the nodes of a tree and may print their values too Tree
Traversal Algorithms can be classified broadly in the following two categories by the order in
which the nodes are visited: Depth-First Search (DFS) Algorithm: It starts with the root node
and first visits all nodes of one branch as deep as possible of the chosen Node and before
backtracking, it visits all other branches in a similar fashion.

There are three subtypes under this

1. Pre-order Traversal (Root, Left ,Right)
2. In-order Traversal (Left ,Root,Right).
3. Post-order Traversal (Left , Right,Root)

Breadth-First Search (BFS) Algorithm: It also starts from the root node and visits all nodes of
current depth before moving to the next depth in the tree.
Type of Tree Traversals :
1. Pre-order Traversal (Root, Left , Right)
2. In-order Traversal (Left ,Root, Right)
3. Post-order Traversal (Left , Right, Root)

Algorithm:
Step 1 − Visit root node.
Step 2 − Recursively traverse left subtree.
Step 3 − Recursively traverse right subtree

Until all nodes are traversed

Pre-order Traversal (Root, Left , Right)

In this traversal method, the root is visited first, then left subtree and later the right sub-tree.
In-order Traversal In this traversal method, the left subtree is visited first, then the root and later the
right sub-tree.
Post-order Traversal(Left , Right, Root)
In this traversal method, the left subtree is visited first, then the right sub-tree and later the root

we visit the left subtree and the right subtree before visiting the current node in recursion
1. Go to left-subtree
2. Go to right-subtree
3.Visit Node