Scribd
Upload
3 views

Data structures (Trees)

Data structure and algorithm lectures ..

Uploaded by

Hira Fatima
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Data structures (Trees)

Data structure and algorithm lectures ..

Uploaded by

Hira Fatima
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

TREES in DATA STRUCTURES

Instructor:
Ms.Dur-e-Shawar Agha
ROAD MAP
 Introduction to Trees

 Basic terminologies used in Trees


TREE
o A tree is a nonlinear data structure, compared to arrays,
linked lists, stacks and queues which are linear data
structures.
o A tree is a collection of nodes connected by directed (or
undirected) edges, where one node is designated as the
root of the tree while the remaining nodes are called as the
children of the root.
o The nodes other than the root node are partitioned into the
non
empty sets where each one of them is to be called sub-tree.
o Nodes of a tree either maintain a parent-child relationship
between them or they are sister nodes.
o In a general tree, A node can have any number of children
nodes but it can have only a single parent.
Hierarchy

Organization Chart Expression Tree

President
+
VP VP
Personnel Marketing * 5

3 2
Director Director
Customer Sales
Relation
Applications of tree

o Storing naturally hierarchical data – File System

o Organize data for quick search, insertion, deletion –


Binary Search Tree

o Text processing – Dictionary

o Mathematical expression
Basic terminology
The following image shows a tree, where the node A is the root node of the tree
while the other nodes can be seen as the children of A.
Contd
….
Root Node :- The root node is the topmost node in the tree hierarchy. In
other words, the root node is the one which doesn't have any parent.
Sub Tree :- If the root node is not null, the tree T1, T2 and T3 is called
sub-trees of the root node.
Leaf Node :- The node of tree, which doesn't have any child node, is
called leaf node. Leaf node is the bottom most node of the tree. There
can be any number of leaf nodes present in a general tree. Leaf nodes
can also be called external nodes.
Path :- The sequence of consecutive edges is called path. In the tree
shown in the above image, path to the node E is A→ B → E.
Contd
….
Ancestor node :- An ancestor of a node is any predecessor node on a
path from root to that node. The root node doesn't have any ancestors. In
the tree shown in the above image, the node F have the ancestors, B
and A.
Degree :- Degree of a node is equal to number of children, a node have.
In the tree shown in the above image, the degree of node B is 2. Degree
of a leaf node is always 0 while in a complete binary tree, degree of each
node is equal to 2.
Level Number :- Each node of the tree is assigned a level number in
such a way that each node is present at one level higher than its parent.
Root node of the tree is always present at level 0.
Types of Tree

The tree data structure can be classified into six different


categories:
Contd
….
Binary Tree
Binary tree is a data structure in which each node can have at most 2 children.
The node present at the top most level is called the root node. A node with the 0
children is called leaf node. Binary Trees are used in the applications like
expression evaluation and many more.
Binary Search Tree
Binary search tree is an ordered binary tree. All the elements in the left sub-tree
are less than the root while elements present in the right sub-tree are greater
than or equal to the root node element. Binary search trees are used in most of
the applications of computer science domain like searching, sorting, etc.
SUMMARY
 Introduction to Tree

 Terminologies used in Tree

 Types of Tree

You might also like