Professional Documents
Culture Documents
3rd DSU (20) MICERO PROJECT VAISHNAVI
3rd DSU (20) MICERO PROJECT VAISHNAVI
TITLE OF MICROPROJECT:
TREE
SEMISTER: 3rd.
COURSE: CM
YEAR: 2021-2022.
Maharashtra state board of technical Education
SNJB’S S.H.H.J. BPOLYTECHNIC, CHANDWAD
Year 2021-22
CERTIFICATE
Name:
1. VAISHNAVI LALIT KADAM.
2. PARVANI DATTAREY PATIL.
Place: -Chandwad
Date: -
COURSE OUTCOME:
a. Perform basic operations on arrays.
b. Apply different searching and sorting techniques.
c. Implement basic operations on stack and queue using array representation.
d. Implement basic operations on Linked List.
e. Implement program to create and traverse tree to solve problems.
SR.NO NAME OF CONTENT POOR (1-3) AVG (4-5) GOOD (6-8) EXC (9-10)
1. Relevance to the course.
2. Literature survey / information
collection.
3. Project proposal.
4. Completion of the target as per
project proposal.
5. Analysis of data and representation.
6. Quality of prototype / model.
7. Report preparation.
8. Presentation.
9. Defense.
PATIL PARVANI
Name and designation of faculty member: A.A. PAWAR. Signature:
Introduction To Tree:-
A tree is a non linear data structure used to represent data containing the hi-
erachical relationship between elements.
Tree is non linear data structure in which node are arranged in a non linear
fashion.
A tree is a connected graph without any circuits/cycle.
There are multiple nodes in a tree .
The nodes are connected with each other with edges.
The tree starts or originates from a node called root node.
TREE TERMINOLOGIES:-
1.Parent 7.Level
2.Child 8.Height
3.Siblings 9.Depth
4.Degree 10.Subtree
5.Internal Node 11.Forest
6.Leaf Node 12.Root
13.Edge
Types Of Trees:-
1.General Tree - No limitation on child nodes.
2. Binary Tree - 0 to 2(0,1, but not more than 2)
3. Strictly Binary Tree – Exactly 2 or 0 (1 child is not accepted or
more than 2 child’s also not accepted).
4. Complete Binary Tree – Every node should have 2 child’s and
all the leaf nodes should be on same level.
5.Skewed Binary Tree – The branches of this tree have either only
left branches or only right branches.
6.Binary Search Tree – In BST, the value of the left child of a node
must be smaller than or equal to the value of its parent and the value of the right
child is always larger than or equal to the value of its parent.
Aim Of Microproject:
PROCEDURE: -
Skill Developed/ learning out of Microproject:
We learned the concept of singly linked list.
Our logic is improved.
Our skill of developing C program is improved.