SlideShare a Scribd company logo
TREE AND TERMINOLOGY
-RACKSAVI.R,
I M.Sc Information Technology,
V.V.Vanniaperumal college for women,
Virudhunagar.
What is tree?
• Tree is a non-linear data structure which
organizes data in hierarchical structure and
this is a recursive definition.
• Tree data structure is a collection of data
(Node) which is organized in hierarchical
structure recursively
• In a tree data structure, if we have N number
of nodes then we can have a maximum of N-1
number of links.
TERMINOLOGY
1. Root
• In a tree data structure, the first node is called
as Root Node.
• Every tree must have a root node.
• We can say that the root node is the origin of
the tree data structure.
• In any tree, there must be only one root
node. We never have multiple root nodes in a
tree.
Terminology of tree
2. Edge
• In a tree data structure, the connecting link
between any two nodes is called as EDGE. In a
tree with 'N' number of nodes there will be a
maximum of 'N-1' number of edges.
3. Parent
• In a tree data structure, the node which is a
predecessor of any node is called as PARENT
NODE.
• The node which has a branch from it to any
other node is called a parent node.
• Parent node can also be defined as "The node
which has child / children".
Terminology of tree
4. Child
• n a tree data structure, the node which is
descendant of any node is called as CHILD
Node.
• The node which has a link from its parent
node is called as child node.
• In a tree, any parent node can have any
number of child nodes.
• In a tree, all the nodes except root are child
nodes.
Terminology of tree
5. Siblings
• In a tree data structure, nodes which belong
to same Parent are called as SIBLINGS.
6. Leaf
• In a tree data structure, the node which does
not have a child is called as LEAF Node.
• In a tree data structure, the leaf nodes are
also called as External Nodes. External node is
also a node with no child.
• In a tree, leaf node is also called as 'Terminal'
node.
Terminology of tree
7. Internal
• In a tree data structure, the node which has
atleast one child is called as INTERNAL Node.
• In a tree data structure, nodes other than leaf
nodes are called as Internal Nodes.
• The root node is also said to be Internal Node
if the tree has more than one node.
• Internal nodes are also called as 'Non-Terminal'
nodes.
Terminology of tree
8. Degree
• In a tree data structure, the total number of
children of a node is called as DEGREE of that
Node.
• The highest degree of a node among all the
nodes in a tree is called as 'Degree of Tree'
Terminology of tree
9. Level
• In a tree data structure, the root node is said
to be at Level 0 and the children of root node
are at Level 1 and the children of the nodes
which are at Level 1 will be at Level 2 and so
on...
• In a tree each step from top to bottom is
called as a Level and the Level count starts
with '0' and incremented by one at each level
(Step).
Terminology of tree
10. Height
• In a tree data structure, the total number of
edges from leaf node to a particular node in
the longest path is called as HEIGHT of that
Node.
• In a tree, height of the root node is said to be
height of the tree. In a tree, height of all leaf
nodes is '0'.
Terminology of tree
11. Depth
• In a tree data structure, the total number of
egdes from root node to a particular node is
called as DEPTH of that Node.
• In a tree, the total number of edges from root
node to a leaf node in the longest path is said
to be Depth of the tree.
• In a tree, depth of the root node is '0'.
Terminology of tree
12. Path
• In a tree data structure, the sequence of
Nodes and Edges from one node to another
node is called as PATH between that two
Nodes.
• Length of a Path is total number of nodes in
that path.
• For example the path A - B - E - J has length 4.
Terminology of tree
13. Sub Tree
• In a tree data structure, each child from a
node forms a subtree recursively. Every child
node will form a subtree on its parent node.
Terminology of tree

More Related Content

What's hot (20)

PPTX
Tree in data structure
ghhgj jhgh
 
PPTX
Queue ppt
SouravKumar328
 
PPTX
linked list in data structure
shameen khan
 
PPTX
Binary Tree in Data Structure
Meghaj Mallick
 
PPTX
Linked list
KalaivaniKS1
 
PPTX
single linked list
Sathasivam Rangasamy
 
PDF
Stack
Zaid Shabbir
 
PPTX
Doubly Linked List
Ninad Mankar
 
DOC
Time and space complexity
Ankit Katiyar
 
PPTX
Linked list
akshat360
 
PPTX
Queue in Data Structure
Janki Shah
 
PPT
Data structures using c
Prof. Dr. K. Adisesha
 
PPT
Circular linked list
chauhankapil
 
PPTX
Stacks IN DATA STRUCTURES
Sowmya Jyothi
 
PDF
UNIT III NON LINEAR DATA STRUCTURES – TREES
Kathirvel Ayyaswamy
 
PDF
Searching and Sorting Techniques in Data Structure
Balwant Gorad
 
PPT
SEARCHING AND SORTING ALGORITHMS
Gokul Hari
 
PPT
BINARY TREE REPRESENTATION.ppt
SeethaDinesh
 
PPTX
DBMS Keys
Tarun Maheshwari
 
PPTX
Introduction to data structure ppt
NalinNishant3
 
Tree in data structure
ghhgj jhgh
 
Queue ppt
SouravKumar328
 
linked list in data structure
shameen khan
 
Binary Tree in Data Structure
Meghaj Mallick
 
Linked list
KalaivaniKS1
 
single linked list
Sathasivam Rangasamy
 
Doubly Linked List
Ninad Mankar
 
Time and space complexity
Ankit Katiyar
 
Linked list
akshat360
 
Queue in Data Structure
Janki Shah
 
Data structures using c
Prof. Dr. K. Adisesha
 
Circular linked list
chauhankapil
 
Stacks IN DATA STRUCTURES
Sowmya Jyothi
 
UNIT III NON LINEAR DATA STRUCTURES – TREES
Kathirvel Ayyaswamy
 
Searching and Sorting Techniques in Data Structure
Balwant Gorad
 
SEARCHING AND SORTING ALGORITHMS
Gokul Hari
 
BINARY TREE REPRESENTATION.ppt
SeethaDinesh
 
DBMS Keys
Tarun Maheshwari
 
Introduction to data structure ppt
NalinNishant3
 

Similar to Terminology of tree (20)

PPTX
Trees-Terminology.pptx
HarshanaReddyGillala
 
PPT
UNIT-4 TREES.ppt
SIVAKUMARM603675
 
PPT
Final tree.ppt tells about tree presentation
nakulvarshney371
 
PPTX
TREE PRESENTATION COMPUTER SCIENCE/DATA STRUCTURE
HaroldOmega1
 
PPT
Tree-introduction ,Definition, Types of BT
VikasNirgude2
 
PDF
Module 8.1 Trees.pdf
GracesonCuyasen1
 
PPTX
Data Structure of computer science and technology
bhaskarsai499
 
PPTX
Introduction to tree ds
Viji B
 
PDF
Unit 2_1 Tree.pdf
KanchanPatil34
 
PPTX
TREES basics simple introduction .pptx
SanGeet25
 
PPTX
TREES 1.pptx
SanGeet25
 
DOCX
data structures Unit 3 notes.docxdata structures Unit 3 notes.docx
yatakonakiran2
 
DOCX
Trees and Graphs in data structures and Algorithms
BHARATH KUMAR
 
PPTX
Data Structures -Non Linear DS-Basics ofTrees
sailaja156145
 
PPT
9. TREE Data Structure Non Linear Data Structure
kejika1215
 
PPT
tree in Data Structures
Shankar Bishnoi
 
PPTX
Unit 5 Tree.pptx
SurajSharma266169
 
PPTX
Lecture 2-Trees in Data Structure Complete Lecture Slide
KrishnenduRarhi
 
PPTX
Presentation1-Data structure S-Tree.pptx
Praveen156918
 
PPTX
Understanding Tree Data Structure and Its Applications
M Munim
 
Trees-Terminology.pptx
HarshanaReddyGillala
 
UNIT-4 TREES.ppt
SIVAKUMARM603675
 
Final tree.ppt tells about tree presentation
nakulvarshney371
 
TREE PRESENTATION COMPUTER SCIENCE/DATA STRUCTURE
HaroldOmega1
 
Tree-introduction ,Definition, Types of BT
VikasNirgude2
 
Module 8.1 Trees.pdf
GracesonCuyasen1
 
Data Structure of computer science and technology
bhaskarsai499
 
Introduction to tree ds
Viji B
 
Unit 2_1 Tree.pdf
KanchanPatil34
 
TREES basics simple introduction .pptx
SanGeet25
 
TREES 1.pptx
SanGeet25
 
data structures Unit 3 notes.docxdata structures Unit 3 notes.docx
yatakonakiran2
 
Trees and Graphs in data structures and Algorithms
BHARATH KUMAR
 
Data Structures -Non Linear DS-Basics ofTrees
sailaja156145
 
9. TREE Data Structure Non Linear Data Structure
kejika1215
 
tree in Data Structures
Shankar Bishnoi
 
Unit 5 Tree.pptx
SurajSharma266169
 
Lecture 2-Trees in Data Structure Complete Lecture Slide
KrishnenduRarhi
 
Presentation1-Data structure S-Tree.pptx
Praveen156918
 
Understanding Tree Data Structure and Its Applications
M Munim
 
Ad

Recently uploaded (20)

PPTX
How to Set Up Tags in Odoo 18 - Odoo Slides
Celine George
 
PPTX
How to Set Maximum Difference Odoo 18 POS
Celine George
 
PPTX
Cultivation practice of Litchi in Nepal.pptx
UmeshTimilsina1
 
PDF
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 - GLOBAL SUCCESS - CẢ NĂM - NĂM 2024 (VOCABULARY, ...
Nguyen Thanh Tu Collection
 
PDF
DIGESTION OF CARBOHYDRATES,PROTEINS,LIPIDS
raviralanaresh2
 
PDF
Women's Health: Essential Tips for Every Stage.pdf
Iftikhar Ahmed
 
PPT
Talk on Critical Theory, Part One, Philosophy of Social Sciences
Soraj Hongladarom
 
PDF
Knee Extensor Mechanism Injuries - Orthopedic Radiologic Imaging
Sean M. Fox
 
PDF
The Different Types of Non-Experimental Research
Thelma Villaflores
 
PPTX
SPINA BIFIDA: NURSING MANAGEMENT .pptx
PRADEEP ABOTHU
 
PDF
CONCURSO DE POESIA “POETUFAS – PASSOS SUAVES PELO VERSO.pdf
Colégio Santa Teresinha
 
PPTX
Stereochemistry-Optical Isomerism in organic compoundsptx
Tarannum Nadaf-Mansuri
 
PPTX
PATIENT ASSIGNMENTS AND NURSING CARE RESPONSIBILITIES.pptx
PRADEEP ABOTHU
 
PPTX
Universal immunization Programme (UIP).pptx
Vishal Chanalia
 
PDF
Dimensions of Societal Planning in Commonism
StefanMz
 
PPTX
STAFF DEVELOPMENT AND WELFARE: MANAGEMENT
PRADEEP ABOTHU
 
PDF
community health nursing question paper 2.pdf
Prince kumar
 
PPT
Talk on Critical Theory, Part II, Philosophy of Social Sciences
Soraj Hongladarom
 
PDF
Biological Bilingual Glossary Hindi and English Medium
World of Wisdom
 
PPTX
Neurodivergent Friendly Schools - Slides from training session
Pooky Knightsmith
 
How to Set Up Tags in Odoo 18 - Odoo Slides
Celine George
 
How to Set Maximum Difference Odoo 18 POS
Celine George
 
Cultivation practice of Litchi in Nepal.pptx
UmeshTimilsina1
 
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 - GLOBAL SUCCESS - CẢ NĂM - NĂM 2024 (VOCABULARY, ...
Nguyen Thanh Tu Collection
 
DIGESTION OF CARBOHYDRATES,PROTEINS,LIPIDS
raviralanaresh2
 
Women's Health: Essential Tips for Every Stage.pdf
Iftikhar Ahmed
 
Talk on Critical Theory, Part One, Philosophy of Social Sciences
Soraj Hongladarom
 
Knee Extensor Mechanism Injuries - Orthopedic Radiologic Imaging
Sean M. Fox
 
The Different Types of Non-Experimental Research
Thelma Villaflores
 
SPINA BIFIDA: NURSING MANAGEMENT .pptx
PRADEEP ABOTHU
 
CONCURSO DE POESIA “POETUFAS – PASSOS SUAVES PELO VERSO.pdf
Colégio Santa Teresinha
 
Stereochemistry-Optical Isomerism in organic compoundsptx
Tarannum Nadaf-Mansuri
 
PATIENT ASSIGNMENTS AND NURSING CARE RESPONSIBILITIES.pptx
PRADEEP ABOTHU
 
Universal immunization Programme (UIP).pptx
Vishal Chanalia
 
Dimensions of Societal Planning in Commonism
StefanMz
 
STAFF DEVELOPMENT AND WELFARE: MANAGEMENT
PRADEEP ABOTHU
 
community health nursing question paper 2.pdf
Prince kumar
 
Talk on Critical Theory, Part II, Philosophy of Social Sciences
Soraj Hongladarom
 
Biological Bilingual Glossary Hindi and English Medium
World of Wisdom
 
Neurodivergent Friendly Schools - Slides from training session
Pooky Knightsmith
 
Ad

Terminology of tree

  • 1. TREE AND TERMINOLOGY -RACKSAVI.R, I M.Sc Information Technology, V.V.Vanniaperumal college for women, Virudhunagar.
  • 2. What is tree? • Tree is a non-linear data structure which organizes data in hierarchical structure and this is a recursive definition. • Tree data structure is a collection of data (Node) which is organized in hierarchical structure recursively
  • 3. • In a tree data structure, if we have N number of nodes then we can have a maximum of N-1 number of links.
  • 5. 1. Root • In a tree data structure, the first node is called as Root Node. • Every tree must have a root node. • We can say that the root node is the origin of the tree data structure. • In any tree, there must be only one root node. We never have multiple root nodes in a tree.
  • 7. 2. Edge • In a tree data structure, the connecting link between any two nodes is called as EDGE. In a tree with 'N' number of nodes there will be a maximum of 'N-1' number of edges.
  • 8. 3. Parent • In a tree data structure, the node which is a predecessor of any node is called as PARENT NODE. • The node which has a branch from it to any other node is called a parent node. • Parent node can also be defined as "The node which has child / children".
  • 10. 4. Child • n a tree data structure, the node which is descendant of any node is called as CHILD Node. • The node which has a link from its parent node is called as child node. • In a tree, any parent node can have any number of child nodes. • In a tree, all the nodes except root are child nodes.
  • 12. 5. Siblings • In a tree data structure, nodes which belong to same Parent are called as SIBLINGS.
  • 13. 6. Leaf • In a tree data structure, the node which does not have a child is called as LEAF Node. • In a tree data structure, the leaf nodes are also called as External Nodes. External node is also a node with no child. • In a tree, leaf node is also called as 'Terminal' node.
  • 15. 7. Internal • In a tree data structure, the node which has atleast one child is called as INTERNAL Node. • In a tree data structure, nodes other than leaf nodes are called as Internal Nodes. • The root node is also said to be Internal Node if the tree has more than one node. • Internal nodes are also called as 'Non-Terminal' nodes.
  • 17. 8. Degree • In a tree data structure, the total number of children of a node is called as DEGREE of that Node. • The highest degree of a node among all the nodes in a tree is called as 'Degree of Tree'
  • 19. 9. Level • In a tree data structure, the root node is said to be at Level 0 and the children of root node are at Level 1 and the children of the nodes which are at Level 1 will be at Level 2 and so on... • In a tree each step from top to bottom is called as a Level and the Level count starts with '0' and incremented by one at each level (Step).
  • 21. 10. Height • In a tree data structure, the total number of edges from leaf node to a particular node in the longest path is called as HEIGHT of that Node. • In a tree, height of the root node is said to be height of the tree. In a tree, height of all leaf nodes is '0'.
  • 23. 11. Depth • In a tree data structure, the total number of egdes from root node to a particular node is called as DEPTH of that Node. • In a tree, the total number of edges from root node to a leaf node in the longest path is said to be Depth of the tree. • In a tree, depth of the root node is '0'.
  • 25. 12. Path • In a tree data structure, the sequence of Nodes and Edges from one node to another node is called as PATH between that two Nodes. • Length of a Path is total number of nodes in that path. • For example the path A - B - E - J has length 4.
  • 27. 13. Sub Tree • In a tree data structure, each child from a node forms a subtree recursively. Every child node will form a subtree on its parent node.