TREE
IN GRAPHTHEORY
1
Presented by: Rabin BK
BSc.CSIT 2nd Semester
Graph Theory
Tree
Terminologies related to Tree
Application of Trees in real life
References
2
A structure amounting to a set of objects in which some pairs of the
objects are in some sense "related "
An ordered pair G =(V, E) comprising set V of vertices, nodes or
points together with a set E of edges, arcs or lines, which are 2-
element subsets of V
3
Graph Theory
A tree is a data structure made up of nodes or vertices and edges
without having any cycle
Node is a data structure consisting of a value
The tree with no nodes is called the null or empty tree
A widely used abstract data type (ADT)
4
Tree
 Root
 Child
 Parent
 Siblings
 Leaf
 Branch
 Internal node
 Degree
 Edge
 Path
 Level
 Height of tree
 Height of node
 Depth
 Forest
5
Some terminologies used with tree
Tree diagram
6
Edge
7
Siblings
8
Leaf
9
Internal nodes
10
Degree
11
Level
12
Height
13
Depth
14
Path
15
Class hierarchy in Java programming language
File system in a computer
Storing hierarchies in organizations
Manipulate hierarchical data.
Make information easy to search (see tree traversal).
Manipulate sorted lists of data.
As a workflow for compositing digital images for visual effects.
Router algorithms
Artificial Intelligence implemented computer games (one can
know all possible moves with the concept of tree)
16
Application of Tree in real life
References
Web reference:
 https://www.youtube.com/watch?v=qH6yxkw0u78
 http://btechsmartclass.com/DS/U3_T1.html
 https://http://users.cs.cf.ac.uk/Dave.Marshall/CM0167/Lectures/CM0167_Chap02
_1_Trees.pdf
17
Queries
18

Tree in Graph Theory in Discrete structure

  • 1.
    TREE IN GRAPHTHEORY 1 Presented by:Rabin BK BSc.CSIT 2nd Semester
  • 2.
    Graph Theory Tree Terminologies relatedto Tree Application of Trees in real life References 2
  • 3.
    A structure amountingto a set of objects in which some pairs of the objects are in some sense "related " An ordered pair G =(V, E) comprising set V of vertices, nodes or points together with a set E of edges, arcs or lines, which are 2- element subsets of V 3 Graph Theory
  • 4.
    A tree isa data structure made up of nodes or vertices and edges without having any cycle Node is a data structure consisting of a value The tree with no nodes is called the null or empty tree A widely used abstract data type (ADT) 4 Tree
  • 5.
     Root  Child Parent  Siblings  Leaf  Branch  Internal node  Degree  Edge  Path  Level  Height of tree  Height of node  Depth  Forest 5 Some terminologies used with tree
  • 6.
  • 7.
  • 8.
  • 9.
  • 10.
  • 11.
  • 12.
  • 13.
  • 14.
  • 15.
  • 16.
    Class hierarchy inJava programming language File system in a computer Storing hierarchies in organizations Manipulate hierarchical data. Make information easy to search (see tree traversal). Manipulate sorted lists of data. As a workflow for compositing digital images for visual effects. Router algorithms Artificial Intelligence implemented computer games (one can know all possible moves with the concept of tree) 16 Application of Tree in real life
  • 17.
    References Web reference:  https://www.youtube.com/watch?v=qH6yxkw0u78 http://btechsmartclass.com/DS/U3_T1.html  https://http://users.cs.cf.ac.uk/Dave.Marshall/CM0167/Lectures/CM0167_Chap02 _1_Trees.pdf 17
  • 18.