The presentation by Dyuti Islam covers the fundamentals of graphs and trees as data structures, delineating types such as linear and non-linear structures. It defines graphs in computer science as a set of nodes and edges, Classifying them into directed, undirected, weighted, and unweighted types, as well as discussing tree structures including binary trees and their traversal methods. The document also touches upon graph coloring and resources for further reading.

1. WELCOME TO MY
PRSENTATION ON
GRAPH AND TREE

2. PRESENTEDTO
MOHAMMADSAROWARJAHAN
MORSHED,ASST.PROFECEOR,DEPERTMENTOFCSE,DAFFODIL
INTERNATINALUNIVERSITY
PRESENTED BY
DYUTI ISLAM
ID:151-15-5435

3. DataStructure
The way of storing data in
computer
Types of data structure
*Linear
*Non -linear

4. Type of data
structure
Linear data structure
array
Linked lists
Stack
queue
Non-linear data structure
Tree
graph

5. Graph

6. WHAT ISGRAPH….? ? ?
In general –
Something written or drawn in a specific way
In mathematics-
A diagram representing a system of
interrelations among two or more things by a
number of distinctive dots, lines, bars etc

7. Graph

8. But In
computer
science graphs
are different
than rest of
others
Let’s know more about it….

9. Graph
A data structure that consists of a set
of nodes (vertices) and a set of edges
that relate the nodes to each other
The set of edges describes
relationships among the vertices

10. Node
and edges

11. Formal definition of graph
A graph G is defined as follows:
G=(V,E)
V(G): a finite, nonempty set of vertices
E(G): a set of edges (pairs of vertices)

12. Classification
of graph
Undirected graph Directed graph

13. Classification
of graphs
Weighted graph Unweighted graph

14. Classification
of graphs
Cyclic graph Acyclic graph
C
A
B

15. Classification
of graphs
IN DEGREE OUT DEGREE

16. Classifications
of graph
 Directed acyclic graph

17. Graph coloring
 Two adjacent vertices never get the same color
 Minimum number of color

18. Graph coloring

19. Representation
of graph
Adjacency list Adjacency matrix

20. Graph
algorithm
 Depth first search

21. Graph
algorithm
 Breadth first search

22. TREE
leaf
branch
root

23. InTerms of
data structure
tree is ….
root
leaf
interior

24. Definition
A tree is a hierarchical representation of a finite set of one or more
data item

25. Root no parent
Leaf no child
Interior non-leaf
H
E
I
G
H
t
TreeTerminology

26. Classification
of
Tree
Binary tree
root can have maximum two children
each children is again cab be a binary tree.

27. Classification
of
Tree
Strict binary tree
root can have exactly two
children or no children at all.

28. Classification
of
Tree
Complete binary tree
 Mainly strict binary tree
 every leaf node is at same level.

29. Tree
transversal
Pre-order: (N L R)

30. Tree
transversal
Post order: (L R N)

31. Tree
transversal
 In order :(L N R)

32. Tree
transversal
In order (L N R)

33. RESOURCES
www.google.com.bd
www.mhprofessional.com
www.assignmentpedia.com
www.cs.utexas.edu
www.slideshare.net/bcadvc/data-
structure
https://www.wikipedia.org
www.slideshare.net

34. Thank you