NON LINEAR Data
Structure Tree
Module - 4
Source : https://www.mygreatlearning.com/blog/understanding-trees-in-data-structures/
,Overview
Hierarchical structure of trees is used in Computer science as an abstract data type
for various applications like data storage, search and sort algorithms. Let us explore
this data type in detail.
,Tree Terminology
A tree is a hierarchical data structure defined as a collection of nodes. Nodes represent value
and nodes are connected by edges. A tree has the following properties:
1. The tree has one node called root. The tree originates from this, and hence it does not
have any parent.
2. Each node has one parent only but can have multiple children.
3. Each node is connected to its children via edge.
, Following diagram explains various terminologies used in a tree structure.
Structure Tree
Module - 4
Source : https://www.mygreatlearning.com/blog/understanding-trees-in-data-structures/
,Overview
Hierarchical structure of trees is used in Computer science as an abstract data type
for various applications like data storage, search and sort algorithms. Let us explore
this data type in detail.
,Tree Terminology
A tree is a hierarchical data structure defined as a collection of nodes. Nodes represent value
and nodes are connected by edges. A tree has the following properties:
1. The tree has one node called root. The tree originates from this, and hence it does not
have any parent.
2. Each node has one parent only but can have multiple children.
3. Each node is connected to its children via edge.
, Following diagram explains various terminologies used in a tree structure.
