Scribd
Upload
10 views14 pages

Introduction to Tree Data Structure

Uploaded by

alamhamza474
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
10 views14 pages

Introduction to Tree Data Structure

Uploaded by

alamhamza474
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 14

Introduction to Tree

Data Structure
• Tree data structure is a hierarchical structure that is used to represent
and organize data in the form of parent child relationship
• The topmost node of the tree is called the root, and the nodes below
it are called the child nodes. Each node can have multiple child nodes,
and these child nodes can also have their own child nodes, forming a
recursive structure.
Basic Terminologies In Tree Data
Structure:
• Parent Node: The node which is an immediate predecessor of a node is
called the parent node of that node. {B} is the parent node of {D, E}.
• Child Node: The node which is the immediate successor of a node is called
the child node of that node. Examples: {D, E} are the child nodes of {B}.
• Root Node: The topmost node of a tree or the node which does not have
any parent node is called the root node. {A} is the root node of the tree
• Leaf Node or External Node: The nodes which do not have any child nodes
are called leaf nodes. {I, J, K, F, G, H} are the leaf nodes of the tree.
• Ancestor of a Node: Any predecessor nodes on the path of the root
to that node are called Ancestors of that node. {A,B} are the ancestor
nodes of the node {E}
• Sibling: Children of the same parent node are called siblings. {D,E} are
called siblings.
• Level of a node: The count of edges on the path from the root node
to that node. The root node has level 0.
• Internal node: A node with at least one child is called Internal Node.
• Neighbour of a Node: Parent or child nodes of that node are called
neighbors of that node.
Why Tree is considered a non-
linear data structure?
• The data in a tree are not stored in a sequential manner i.e., they are
not stored linearly. Instead, they are arranged on multiple levels or we
can say it is a hierarchical structure. For this reason, the tree is
considered to be a non-linear data structure.
Properties of Tree Data
Structure:
• Number of edges: An edge can be defined as the connection between two nodes. If a
tree has N nodes then it will have (N-1) edges. There is only one path from each node
to any other node of the tree.
• Depth of a node: The depth of a node is defined as the length of the path from the root
to that node. Each edge adds 1 unit of length to the path. So, it can also be defined as
the number of edges in the path from the root of the tree to the node.
• Height of a node: The height of a node can be defined as the length of the longest path
from the node to a leaf node of the tree.
• Height of the Tree: The height of a tree is the length of the longest path from the root
of the tree to a leaf node of the tree.
• Degree of a Node: The total count of subtrees attached to that node is called the
degree of the node. The degree of a leaf node must be 0. The degree of a tree is the
maximum degree of a node among all the nodes in the tree.
Tree Traversal Techniques
• Tree Traversal techniques include various ways to visit all the nodes
of the tree. Unlike linear data structures (Array, Linked List, Queues,
Stacks, etc) which have only one logical way to traverse them, trees
can be traversed in different ways.
Tree Traversal Techniques:
• Depth First Search or DFS
• Inorder Traversal
• Preorder Traversal
• Postorder Traversal
• Level Order Traversal or Breadth First Search or BFS
Inorder Traversal:
• Inorder traversal visits the node in the order: Left -> Root -> Right
Preorder Traversal:

• Preorder traversal visits the node in the order: Root -> Left -> Right
Postorder Traversal:
• Postorder traversal visits the node in the order: Left -> Right -> Root
Level Order Traversal :
• Level Order Traversal visits all nodes present in the same level
completely before visiting the next level.

You might also like