CST201 M4 Ktunotes - in

TREE & GRAPH
DATA STRUCTURES
MODULE IV
Jacob P Cherian
Asst.Professor
Dept.of CSE, Saintgits College of Engineering
1
Downloaded
Jacob P Cherian, Assistant fromofKtunotes.in
Professor, Department CSE, Saintgits College of Engineering
CONTENTS
Introduction to Tree Data Structure
Tree Operations
Binary Tree Representations
Tree Traversals
Binary Search Trees
Binary Search Tree Operations
Introduction to Graph Data Structure
Representation of Graphs
Graph Traversal- BFS & DFS
Application of Graphs 2
Downloaded
Tree- Definition
A tree is a finite set of one or more nodes such that:
i)there is a specially designated node called the root.
ii) remaining nodes are partitioned into n(n>0) disjoint sets T1,T2...Tn,
where each Ti(i=1,2...n) are called subtrees of the root.
Downloaded
Trees- Basic Idea
A tree is a collection of entities called nodes. Nodes are connected by

edges. Each node contains a value or data, and it may or may not have
a child node.
The first node of the tree is called the root. If this root node is
connected by another node, the root is then a parent node and the
connected node is a child.
Downloaded
Example of a General Tree
A ROOT NODE
B C
D E F
G H I
Downloaded
Terminology- Parent & Child
A PARENT
CHILDREN
B C
D E F
G H I
Downloaded
Terminology- Parent & Child
A
B C
D E F
PARENT
G H I CHILDREN
Downloaded
Trees- Basic Idea
All Tree nodes are connected by links called edges. It’s an important
part of trees, because it’s manages the relationship between nodes.
Leaves are the last nodes on a tree. They are nodes without children.
Like real trees, we have the root, branches, and finally the leaves.
Downloaded
A
B C
D E F
LEAF NODES
G H I
Downloaded
A
SIBLINGS
B C
D E F
Nodes which have the same
parent are called siblings
G H I
Downloaded
Terminology- Levels
A LEVEL 0
B C LEVEL 1
D E F LEVEL 2
G H I LEVEL 3
Downloaded
Terminology- Height of a Tree
A
B C The height of a tree is the

number of edges on the
longest downward path
between the root and a leaf
D E F
Height = 3
G H I
Downloaded
Binary Trees-Basic Idea
A binary tree is a tree data structure in which each node has at most
two children, which are referred to as the left child and the right child.
Downloaded
Binary Tree- Example
A
Each node has either 0,
1 or 2 Children
B C
D E F
G H
Downloaded
Size of a Binary Tree
A
Size = 8 The total number of nodes in a
binary tree is known as the
size of a binary tree
B C
D E F
G H
Downloaded
External Nodes & Internal Nodes
A
External node is a node
with at least one child
B C
Internal node is a node

with no children
D E F
G H
Downloaded
External Nodes & Internal Nodes
A
External node is a node
with at least one child
B C
Internal node is a node

with no children
D E F
G H
Downloaded
Left Sub-tree & Right Sub-tree
A
Left Subtree of
A
B C
Right Subtree of
A
D E F
G H
Downloaded
Left Subtree & Right Subtree
A
B C
Right Subtree of
D E F Node C
Left Subtree of
Node C
G H
Downloaded
Maximum no:of nodes at any Level of a Binary
Tree
A
Maximum no:of nodes
possible at any level, (say
i)of a binary tree 2i
B C
D E F
G H
Downloaded
Full Binary Tree
A full Binary tree is a special type of binary tree in which every parent
node has either two or no children
Downloaded
Full Binary Tree- Example
Downloaded
Complete Binary Tree
A complete binary tree is a binary tree in which all the levels are
completely filled except possibly the lowest one, which is filled from the
left. All the leaf elements must lean towards the left.
Downloaded
Complete Binary Tree- Example
Downloaded
Identify- Binary Tree(BT), Complete BT or Full
BT
a) b)
Downloaded
Identify- Binary Tree(BT), Complete BT or Full BT
c) d)
Downloaded
Identify- Binary Tree(BT), Complete BT or Full BT
e) f)
Downloaded
Tree Traversal
Downloaded
Tree Traversal
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.
Inorder Traversal - (Left ST, N(Root), Right ST) LNR
Preorder Traversal - (N(Root), Left ST, Right ST) NLR
Postorder Traversal - (Left ST, Right ST, N(Root)) LRN
Downloaded
Inorder Traversal LNR
A
B C
D E F
G H
Downloaded
A
B C
D E F
G H
Downloaded
A
B C
D E F
G H
Downloaded
A
B C
D E F
G H
Downloaded
A
B C
D E F
Inorder Traversal
D
G H
Downloaded
A
B C
D E F
Inorder Traversal
DB
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBA
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBA
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBA
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBA
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBAG
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBAGE
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBAGE
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBAGEH
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBAGEHC
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBAGEHC
G H
Downloaded
A
B C
D E F
Inorder Traversal
DBAGEHCF
G H
Downloaded
Preorder Traversal
Downloaded
Preorder Traversal NLR
A
B C
D E F
Preorder Traversal
G H
Downloaded
A
B C
D E F
Preorder Traversal
A
G H
Downloaded
A
B C
D E F
Preorder Traversal
AB
G H
Downloaded
A
B C
D E F
Preorder Traversal
ABD
G H
Downloaded
A
B C
D E F
Preorder Traversal
ABDC
G H
Downloaded
A
B C
D E F
Preorder Traversal
ABDCE
G H
Downloaded
A
B C
D E F
Preorder Traversal
ABDCEG
G H
Downloaded
A
B C
D E F
Preorder Traversal
ABDCEGH
G H
Downloaded
A
B C
D E F
Preorder Traversal
ABDCEGHF
G H
Downloaded
Postorder Traversal
Downloaded
Postorder Traversal LRN
A
B C
D E F
Postorder Traversal
G H
Downloaded
A
B C
D E F
Postorder Traversal
G H
Downloaded
A
B C
D E F
Postorder Traversal
G H
Downloaded
A
B C
D E F
Postorder Traversal
G H
Downloaded
A
B C
D E F
Postorder Traversal
D
G H
Downloaded
A
B C
D E F
Postorder Traversal
DB
G H
Downloaded
A
B C
D E F
Postorder Traversal
DB
G H
Downloaded
A
B C
D E F
Postorder Traversal
DB
G H
Downloaded
A
B C
D E F
Postorder Traversal
DB
G H
Downloaded
A
B C
D E F
Postorder Traversal
DBG
G H
Downloaded
A
B C
D E F
Postorder Traversal
DBG
G H
Downloaded
A
B C
D E F
Postorder Traversal
DBGH
G H
Downloaded
A
B C
D E F
Postorder Traversal
DBGHE
G H
Downloaded
A
B C
D E F
Postorder Traversal
DBGHE
G H
Downloaded
A
B C
D E F
Postorder Traversal
DBGHEF
G H
Downloaded
A
B C
D E F
Postorder Traversal
DBGHEFC
G H
Downloaded
A
B C
D E F
Postorder Traversal
DBGHEFCA
G H
Downloaded
Traversal Summary
A Inorder Traversal
DBAGEHCF
B C
Preorder Traversal
ABDCEGHF
D E F
Postorder Traversal
DBGHEFCA
G H
Downloaded
Practice Problem- Find Inorder, Preorder, Postorder
Traversal
B C
D E F
G I J
Downloaded
Practice Problem- Find Inorder, Preorder, Postorder
Traversal
45
23 13
9
67
89 6 7
Downloaded
Find the Binary Tree
Given:
Inorder Traversal - 4,2,5,1,3,6
Postorder Traversal - 4,5,2,6,3,1
Downloaded
Find the Binary Tree
Given:
Inorder Traversal - 4,2,5,1,3,6
Postorder Traversal - 4,5,2,6,3,1
Downloaded
GATE Question- CS 2013
The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The
inorder traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. The height
of a tree is the length of the longest path from the root to any leaf. The
height of the binary tree above is ________ .
(A) 2
(B) 3
(C) 4
(D) 5
Downloaded
Binary Search Trees
Downloaded
Binary Search Trees(BST)- Basic Idea
For a Binary Search Tree
All nodes of left subtree are less than the root node
All nodes of right subtree are more than the root node
Both subtrees of each node are also BSTs i.e. they have the above two
properties
Downloaded
BST-Example
45
23 56
69
17
9 21 66 78
Downloaded
Is this BT a BST???
55
23 69
88
17 45
9 21 63 91
Downloaded
Is this BT a BST???
55
23 69
88
17 45
9 21 63 91
Downloaded
Draw a BST by inserting the elements in the order
75,12,97,22,35,9,103
Downloaded
75,12,97,22,35,9,103
75
Downloaded
75,12,97,22,35,9,103
75
12
Downloaded
75,12,97,22,35,9,103
75
12 97
Downloaded
75,12,97,22,35,9,103
75
12 97
22
Downloaded
75,12,97,22,35,9,103
75
12 97
22
35
Downloaded
75,12,97,22,35,9,103
75
12 97
9 22
35
Downloaded
75,12,97,22,35,9,103
75
12 97
9 22 103
35
Downloaded
GATE Question- CS 2013
The preorder traversal sequence of a binary search tree is 30, 20, 10,
15, 25, 23, 39, 35, 42. Which one of the following is the postorder
traversal sequence of the same tree?
(A) 10, 20, 15, 23, 25, 35, 42, 39, 30
(B) 15, 10, 25, 23, 20, 42, 35, 39, 30
(C) 15, 20, 10, 23, 25, 42, 35, 39, 30
(D) 15, 10, 23, 25, 20, 35, 42, 39, 30
Downloaded
Practice Question
Insert the following nodes into an empty Binary Search Tree
39,56,23,19,45,59,78,82,80,91,99
a. Perform inorder traversal

b. Perform preorder traversal
c. Perform postorder traversal
Downloaded
Properties of Binary Trees
Height of a Binary Tree
Maximum Height
Hmax = N-1
Minimum Height
Hmin = Floor(log2 N )
Downloaded
Properties of Binary Trees
Maximum Nodes
Given the Height*,
Maximum Nodes, Nmax=2H+1 - 1
* Height of a BT is the length of the longest path from root to the leaf
Downloaded
GATE Question
Which of the following height is not possible for a binary tree with 50
nodes?
(A) 4
(B) 5
(C) 6
(D) None
Downloaded
Balance Factor
The Balance Factor of a BT is the difference in height of the left sub-tree

and right sub-tree.
If we define the height of the left subtree as H L and the height of the
right subtree as HR, the balance factor of the tree, B, is determined by

the following formula:
B= HL-HR
Downloaded
Balanced Binary Trees
In a balanced binary tree, the height of its subtrees differs by no more

than one (its balance factor is –1, 0, or +1), and its subtrees are also
balanced.
Downloaded
Balanced Binary Trees
B C
D E F
Downloaded
Is the BT Balanced?
B C
E F
Downloaded
Representation of a
Binary Tree Node
Downloaded
Representing a Tree Node
Pointer to Left Child Data Pointer to Right Child
Downloaded
Representing a Binary Tree
root
Downloaded
Node Structure corresponding to the BT?
55
23 69
88
17 45
Downloaded
Node Structure corresponding to the BT
root
55
23 69
17 45 88
Downloaded
Searching for a Key
In Binary Search Tree
Downloaded
Searching for a key
45
Search for the key 66
23 56
69
17
9 21 66 78
Downloaded
Searching for a key
66 > 45, Traverse RST
45
23 56
69
17
9 21 66 78
Downloaded
Searching for a key
45
66 > 56, Traverse RST

23 56
69
17
9 21 66 78
Downloaded
Searching for a key
45
23 56
66 < 69, Traverse
LST
69
17
9 21 66 78
Downloaded
Searching for a key
45
23 56
69
17
9 21 66 78
Element
Found
Downloaded
Deleting a Node
In Binary Search Tree
Downloaded
Deleting a Node
Three Cases:
1. Node to be deleted has 0 Child (Deleting Leaf Node)
2. Node to be deleted has 1 Child

3. Node to be deleted has 2 Children
(Replace Node with Inorder Successor/Inorder Predecessor)
Downloaded
Deleting a Node
Case 1: Deleting a Leaf Node
45
Delete the Node 21
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Case 1: Deleting a Leaf Node Traverse to the Node
45 using Key Value
Delete the Node 21
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Case 1: Deleting a Leaf Node Set corresponding link
45 of Parent to NULL
Delete the Node 21
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
45
23 56
69
17
9 66 78
Downloaded
Deleting a Node
Case 2: Delete the Node
45
17
23 56
69
17
9 66 78
Downloaded
Deleting a Node
Case 2: Delete the Node Traverse to the Node
45 using Key Value
17
23 56
69
17
9 66 78
Downloaded
Deleting a Node
Case 2: Delete the Node Link the child directly to
45 the parent of the Node
17
23 56
69
17
9 66 78
Downloaded
Deleting a Node
45
45
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Find Inorder Predecessor
45 or Inorder Successor
45
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Inorder Predecessor is
45 the largest node in the
45
LST of the node to be
deleted
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Inorder Predecessor is
45 the largest node in the
45
LST of the node to be
deleted
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Replace node to be
deleted with the Inorder
45
23 Predecessor
17 56
69
9 21
66 78
Downloaded
Deleting a Node
45
45
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Inorder Successor is the
Case 3: Delete the Node smallest node in the RST
45 of the node to be deleted
45
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Inorder Successor is the
Case 3: Delete the Node smallest node in the RST
45 of the node to be deleted
45
23 56
69
17
9 21 66 78
Downloaded
Deleting a Node
Replace node to be
56 deleted with the Inorder
45
Successor
23 69
17
66 78
9 21
Downloaded
Summary
Replacement using Inorder Predecessor Replacement using Inorder Successor
Downloaded
Practice Question
Delete the Node
56 45
23 56
50 69
17
9 21 66 78
Downloaded
Sequential Representation of a BT
The sequential representation of a binary tree is obtained by storing the
record corresponding to node i of the tree as the ith record in an array of
records.
Downloaded
Sequential Representation
Case1: Array Index Starting at 0

For any node ‘i’
Left Child at (2*i)+1
Right Child at (2*i)+2
Parent at (i-1)/2
Case2: Array Index Starting at 1

For any node ‘i’
Left Child at (2*i)
Right Child at (2*i)+1
Parent at i/2
Downloaded
A
B C
F
D E
A B C D E - F - - - - - -
0 1 2 3 4 5 6 7 8 9 10 11 12
Downloaded
For node B
A
Left Child at (2*1)+1
B C
F
D E
A B C D E - F - - - - - -
0 1 2 3 4 5 6 7 8 9 10 11 12
Downloaded
For node B
A
Right Child at (2*1)+2
B C
F
D E
A B C D E - F - - - - - -
0 1 2 3 4 5 6 7 8 9 10 11 12
Downloaded
For node F
A
Parent at (6-1)/2
B C
F
D E
A B C D E - F - - - - - -
0 1 2 3 4 5 6 7 8 9 10 11 12
Downloaded
Draw the BT corresponding to the Sequential
Representation
Downloaded
Practice Problems
A binary tree has 10 nodes. The preorder and inorder traversals of the
tree are shown below. Draw the tree. Preorder: JCBADEFIGH
Inorder: ABCEDFJGIH
Downloaded
Practice Problems
A binary tree has eight nodes. The postorder and inorder traversals of
the tree are given below. Draw the tree. Postorder: FECHGDBA
Inorder: FCEABHDG
Downloaded
Practice Problems
A binary tree has seven nodes. The preorder and postorder traversals of
the tree are given below. Can you draw the tree? If not, explain.
Preorder: GFDABEC
Postorder: ABDCEFG
Downloaded
Practice Problems
Given the Preorder traversal of a BST. Draw the BST
23,10,5,1,8,14,30,25,34,32,43
Downloaded
Introduction to
Graph Data Structure
Downloaded
Graphs- Definition
A graph is a pair G = (V, E), where V is a set whose elements are called
vertices , and E is a set of paired vertices, whose elements are called

edges.
Downloaded
Graph Data Structure- Basics
A B
C
D E
G = (V , E) F
V = { A,B,C,D,E,F}
E= {(A,B),(A,C),(B,E),(E,D),(D,F),(C,F)}
Downloaded
A B
E
D C
F
EDGES or LINKS
Downloaded
A B
E
D C
F
NODES or VERTICES
Downloaded
Order & Size of a Graph
Order = | V | A B
C
D E
F
Size = | E |
Downloaded
Real World Examples
Social Networks as a Graph
City - Road Network
Downloaded
Types of Graphs
Weighted Graph Complete Graph
Un-weighted Graph Connected Graph
Regular Graph
Directed Graph
Undirected Graph
Simple Graph Disconnected Graph
Downloaded
Weighted Graph
9
A B
7 2 7
E
D C
4 5
3
8
F
A weighted graph is a graph in G
which each edge is given a
numerical weight.
Downloaded
Un-weighted Graph
A B
E
D C
F
G
Downloaded
Undirected Graph
A B
E
D C
F
A graph in which all the edges G
are bi-directional
Downloaded
Directed Graph
A B
E
D C
A graph in which all the

edges are directed from one F
G
vertex to another.
Downloaded
Simple Graph
Undirected graph that has no loops (edges connected at both ends to

the same vertex) and no more than one edge between any two different
vertices
Downloaded
Simple Graph - Example
A B
A B
D C
D C
C
C
Simple Graph
Not a Simple Graph
Downloaded
Disconnected Graph
A B
H
E
D
C
F
G
--- Isolated Nodes
Downloaded
Degree of a Vertex
A B
C
D E
The degree of a vertex of a

graph is the number of edges F
that are incident to the vertex
Downloaded
Degree of a Vertex
A B
In-degree
Out-degree
E
D C
F
G
Downloaded
Regular Graph
A regular graph is a graph where each vertex has the same number of
neighbors; i.e. every vertex has the same degree
A B
D C
In the example, Each vertex has a degree 2
Downloaded
Path
A path of length ‘n’ from node ‘u’ to node ‘v’ is defined as sequence of
n+1 nodes.
P(u,v)=(v0,v1,v2,v3…….vn)
Downloaded
Complete Graph
Complete graphs are graphs that have an edge between every single
vertex in the graph.
A connected graph is a graph in which it's possible to get from every

vertex in the graph to every other vertex through a series of edges,
called a path.
Downloaded
Complete Graph (K3)
A B
Downloaded
Complete Graph (K4)
A B
C D
Downloaded
Adjacent Vertices
A B
C
D
E
F
Downloaded
Adjacent Vertices
A B
E
C
F
G
--- Adjacent Vertices of A
Downloaded
Adjacent Vertices
A B
C
D
E
F
--- Adjacent Vertices of B
Downloaded
Adjacent Vertices
A B
C
D
E
F
--- Adjacent Vertices of D
Downloaded
Adjacent Vertices
A B
C
D
E
F
--- Adjacent Vertices of F
Downloaded
Adjacent Vertices
A B
E
C
F
G
--- Adjacent Vertices of F
Downloaded
Adjacent Vertices
A B
E
C
F
G
--- Adjacent Vertices of E
Downloaded
Graph Representation
Reference: https://medium.com/basecs/from-theory-to-practice-representing-graphs-cfd782c5be38#
Downloaded
Graph Representation
Adjacency Matrix
Edge List
Adjacency List
Downloaded
Adjacency Matrix
An adjacency matrix1 is a square matrix used to represent a finite

graph. The elements of the matrix indicate whether pairs of vertices are
adjacent or not in the graph.
An edge <A,B> is represented by a ‘1’, in the corresponding cell (A,B)

of the matrix.
A ‘0’ indicates that no edge is present between a pair of vertices.
1
Definition from Wikipedia
Downloaded
Adjacency Matrix
0 1 2 3 4 5
0 0 1 1 0 0 0
0 1
1 1 0 0 1 1 0
2 2 1 0 0 0 1 0
3
3 0 1 0 0 0 1
4 4 0 1 1 0 0 1
5
5 0 0 0 1 1 0
Downloaded
Edge List
An edge list is a list (or array) of all the edges in a graph. Edge lists are
one of the most simplest ways to represent a graph.
We can either use a list format or an array to represent an edge list

(language specific)
Downloaded
Edge List- Example
[
[0,2],
0 1 Index
0 0 2 [0,1],
2 1 0 1 [1,3],
3
2 1 3 [1,4],
3 1 4 [2,4],
4
5
4 2 4 [3,5],
5 3 5 [4,5]
Can be implemented
using a struct array
6 4 5 ]
Downloaded
Adjacency Lists
An adjacency list is an array of linked lists that serves as a

representation of a graph, but also makes it easy to see which other
vertices are adjacent to other vertices.
Downloaded
Adjacency Lists
0 1
0 1
1 2
2
1 1
1 2
2 1
1
2
3 2 0
0 4
4
3
1
1 5
5
4 4
5 1
1 2
2 5
5
5
3
3 4
4
Downloaded
Graph Traversals
Depth First Search(DFS)
Breadth First Search(BFS)
Downloaded
Depth First Traversal
Downloaded
DFS-Example
A B
C
D Stack
E
F
Unvisited node
Visited node Output
Downloaded
Start with a random node, mark it visited , push it onto the stack,
output the node
A B
C Stack
D
E
F A
Unvisited node
Output A
Visited node
Downloaded
Select one of the un-explored nodes of A
A B
C Stack
D
E
F A
Unvisited node
Output A
Visited node
Downloaded
Mark C as visited , push it onto the stack, output the node
A B
C Stack
D
C
E
F A
Unvisited node
Output A C
Visited node
Downloaded
Select one of the un-explored nodes of C
A B
C Stack
D
C
E
F A
Unvisited node
Output A C
Visited node
Downloaded
Mark E as visited , push it onto the stack, output the node
A B
C Stack
D
E
C
E
F A
Unvisited node
Output A C E
Visited node
Downloaded
Select one of the un-explored nodes of E
A B
C Stack
D
E
C
E
F A
Unvisited node
Output A C E
Visited node
Downloaded
Mark B as visited , push it onto the stack, output the node
A B
B
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B
Visited node
Downloaded
No un-explored nodes available from node B, pop the stack
A B
B
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B
Visited node
Downloaded
No un-explored nodes available from node B, pop the stack
A B
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B
Visited node
Downloaded
Find an unexplored node from E
A B
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B
Visited node
Downloaded
Mark F as visited , push it onto the stack, output the node
A B
F
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B F
Visited node
Downloaded
Find an unexplored node from F
A B
F
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B F
Visited node
Downloaded
Mark D as visited , push it onto the stack, output the node
A B
F
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B F D
Visited node
Downloaded
No un-explored nodes available from node D, pop the stack
A B
F
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B F D
Visited node
Downloaded
No un-explored nodes available from node F, pop the stack
A B
F
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B F D
Visited node
Downloaded
No un-explored nodes available from node E, pop the stack
A B
C Stack
D
E
C
E
F A
Unvisited node
Output A C E B F D
Visited node
Downloaded
No un-explored nodes available from node C, pop the stack
A B
C Stack
D
C
E
F A
Unvisited node
Output A C E B F D
Visited node
Downloaded
No un-explored nodes available from node A, pop the stack
A B
C Stack
D
E
F A
Unvisited node
Output A C E B F D
Visited node
Downloaded
Stack is Empty ! Output the DFS Traversal
A B
C Stack
D
E
F
Unvisited node
Output A C E B F D
Visited node
Downloaded
Point to Remember
During DFS, if the stack becomes empty, while there are

still unvisited nodes, resume DFS with a random unvisited
node
Downloaded
Types of Edges in DFS
Downloaded
Types of Edges in DFS
Tree Edge Forward Edge

It is an edge which is present in Edge (u, v) such that v appears
the tree obtained after applying after u and there is a path from u
DFS on the graph. to v.
u is Ancestor
Back Edge Cross Edge

Edge (u, v) such that v appears Edge (u, v) such that there is no
before u and there is a path path from v to u in the DFS Tree
from u to v. Neither Ancestor nor Descendant
v is Ancestor
Downloaded
Finding DFS Edges A B
C D Stack
E F
A B C D E F
Downloaded
C D Stack
A
E F
A B C D E F
Downloaded
C D Stack
C
E F
1 0
A B C D E F
Downloaded
C D Stack
B
C
E F
1 2
A B C D E F
Downloaded
C D Stack
B
C
E F
1 2 3 0
A B C D E F
Downloaded
C D Stack
C
E F
1 4 2 3 0
A B C D E F
Downloaded
C D Stack
C
E F
1 4 2 3 0
A B C D E F
Downloaded
C D Stack
C
E F
1 4 2 3 0 5
A B C D E F
Downloaded
C D Stack
F
C
E F
1 4 2 3 0 5 6
A B C D E F
Downloaded
C D Stack
C
E F
1 4 2 3 0 5 6 7
A B C D E F
Downloaded
C D Stack
D
C
E F
1 4 2 3 0 8 5 6 7
A B C D E F
Downloaded
C D Stack
C
E F
1 4 2 3 0 8 9 5 6 7
A B C D E F
Downloaded
C D Stack
C
E F
1 4 2 3 0 8 9 5 10 6 7
A B C D E F
Downloaded
C D Stack
E F
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Finding DFS Edges
C D
E F
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
C
Drawing the DFS Tree
A
E
B
F
Downloaded
A B
Tree Edges
Finding DFS Edges
C D
What about Edges
FC , FB , CB ?
E F
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Finding DFS Edges
Consider the Edge
C D CB
B appears after C
E F
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Finding DFS Edges
Consider the Edge
C D CB
B appears after C
E F
There is a path from
C to B
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Forward Edges
Finding DFS Edges
C D
E F CB is a forward edge
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Forward Edges
Finding DFS Edges
C D
E F Consider the edge FC
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Forward Edges
Finding DFS Edges
C D
C appears before F
E F
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Forward Edges
Finding DFS Edges
C D
C appears before F
E F
There is a path from
F to C
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Forward Edges
Finding DFS Edges
Back Edges
C D
FC is a Back Edge
E F
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Forward Edges
Finding DFS Edges
Back Edges
C D
Consider the edge FB
E F
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
A B
Tree Edges
Forward Edges
Finding DFS Edges
Back Edges
C D
Cross Edges
No path from F to B
E
in DFS Tree
F
FB is a Cross Edge
1 4 2 3 0 11 8 9 5 10 6 7
A B C D E F
Downloaded
Marked Edges for the DFS Tree
A B
Tree Edges
Forward Edges
Back Edges
C D
Cross Edges
E F
Downloaded
Breadth First Traversal
Downloaded
BFS Traversal
A B G
C
F
7 6 5 4 3 2 1 0
D
E
Queue
Unvisited node
Visited node
Output
Downloaded
Start BFS with a random node
A B G
C
F
7 6 5 4 3 2 1 0
D
E
Queue
Unvisited node
Visited node
Output
Downloaded
Starting with C, Mark C as Visited, Display C, Add to Queue
A B G
C
F
7 6 5 4 3 2 1 0
C
D
E
Queue
Unvisited node
Visited node
Output C
Downloaded
Add all adjacent, non-visited vertices of C to the Queue
(which are not already in the Queue).Remove C from the Queue
A B G
C
F
7 6 5 4 3 2 1 0
D A C
D
E
Queue
Unvisited node
Visited node
Output C
Downloaded
Mark A as visited,Display A. Add all adjacent, non-visited vertices (which are not
already in the Queue) of A to the Queue & Remove A
A B G
C
F
7 6 5 4 3 2 1 0
E B D A C
D
E
Queue
Unvisited node
Visited node
Output C A
Downloaded
Mark D as visited,Display D.Add all adjacent, non-visited vertices (which are not
already in the Queue) of D to the Queue & Remove D
A B G
C
F
7 6 5 4 3 2 1 0
E B D A C
D
E
Queue
Unvisited node
Visited node
Output C A D
Downloaded
Mark B as visited,Display B.Add all adjacent, non-visited vertices (which are not
already in the Queue) of B to the Queue & Remove B
A B G
C
F
7 6 5 4 3 2 1 0
G E B D A C
D
E
Queue
Unvisited node
Visited node
Output C A D B
Downloaded
Mark E as visited,Display E.Add all adjacent, non-visited vertices (which are not
already in the Queue) of E to the Queue & Remove E
A B G
C
F
7 6 5 4 3 2 1 0
F G E B D A C
D
E
Queue
Unvisited node
Visited node
Output C A D B E
Downloaded
Mark G as visited,Display G.Add all adjacent, non-visited vertices (which are not
already in the Queue) of G to the Queue & Remove G
A B G
C
F
7 6 5 4 3 2 1 0
F G E B D A C
D
E
Queue
Unvisited node
Visited node
Output C A D B E G
Downloaded
Mark F as visited,Display F.Add all adjacent, non-visited vertices (which are not
already in the Queue) of F to the Queue & Remove F
A B G
C
F
7 6 5 4 3 2 1 0
F G E B D A C
D
E
Queue
Unvisited node
Visited node
Output C A D B E G F
Downloaded
Mark F as visited,Display F.Add all adjacent, non-visited vertices (which are not
already in the Queue) of F to the Queue & Remove F
A B G QUEUE IS EMPTY
ALL NODES ARE

C VISITED & EXPLORED
F
7 6 5 4 3 2 1 0
F G E B D A C
D
E
Queue
Unvisited node
Visited node
Output C A D B E G F
Downloaded
Finding BFS Tree
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
E D F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
E D F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
G E D F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
G E D F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
G E D F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
C G E D F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
C G E D F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A B
C D E
F G
7 6 5 4 3 2 1 0
C G E D F B A
Unvisited node
Visited node
Queue
Downloaded
Finding BFS Tree
A
F B
G D E
Downloaded
Application of Graphs
Downloaded
Application of Graphs
Contact Tracing Knowledge Graphs
Social Graphs
Web Document Graphs
Neural Networks Blockchain Networks
Road Networks Path Optimization
Downloaded
Example for a Knowledge Graph
Source : https://medium.com/@brkyataman/knowledge-graph-and-youtube-29d259fd3dc1
Downloaded
Example for a Social Graph
Source : https://towardsdatascience.com/how-to-visualize-social-network-with-graph-theory-4b2dc0c8a99f
Downloaded
Example for a Contact Tracing Graph
Source : https://dzone.com/articles/contact-tracing-apps-for-proximity-alerts
Downloaded
Example for a Neural Network Graph
Input Layer Hidden Layer Output Layer
Source : https://dzone.com/articles/contact-tracing-apps-for-proximity-alerts
Downloaded
Example for a Web Document Graph
Source : https://www.groundai.com/project/a-graph-structured-dataset-for-wikipedia-research/1
Downloaded
Example for a Road Network Graph
Source : https://medium.com/@ghalstein97/exploring-graphing-algorithms-in-computer-science-b67c653a5e21
Downloaded

CST201 M4 Ktunotes - in

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CST201 M4 Ktunotes - in

Uploaded by

Copyright:

Available Formats

TREE & GRAPH

A tree is a finite set of one or more nodes such that:

i)there is a specially designated node called the root.

A tree is a collection of entities called nodes. Nodes are connected by

B C The height of a tree is the

Internal node is a node

Internal node is a node

Inorder Traversal - (Left ST, N(Root), Right ST) LNR

Preorder Traversal - (N(Root), Left ST, Right ST) NLR

Postorder Traversal - (Left ST, Right ST, N(Root)) LRN

Inorder Traversal - 4,2,5,1,3,6

Postorder Traversal - 4,5,2,6,3,1

Inorder Traversal - 4,2,5,1,3,6

Postorder Traversal - 4,5,2,6,3,1

For a Binary Search Tree

(A) 10, 20, 15, 23, 25, 35, 42, 39, 30

(B) 15, 10, 25, 23, 20, 42, 35, 39, 30

(C) 15, 20, 10, 23, 25, 42, 35, 39, 30

(D) 15, 10, 23, 25, 20, 35, 42, 39, 30

Insert the following nodes into an empty Binary Search Tree

a. Perform inorder traversal

Height of a Binary Tree

Given the Height*,

Maximum Nodes, Nmax=2H+1 - 1

The Balance Factor of a BT is the difference in height of the left sub-tree

right subtree as HR, the balance factor of the tree, B, is determined by

In a balanced binary tree, the height of its subtrees differs by no more

Pointer to Left Child Data Pointer to Right Child

66 > 56, Traverse RST

1. Node to be deleted has 0 Child (Deleting Leaf Node)

2. Node to be deleted has 1 Child

Replacement using Inorder Predecessor Replacement using Inorder Successor

The sequential representation of a binary tree is obtained by storing the

record corresponding to node i of the tree as the ith record in an array of

Case1: Array Index Starting at 0

Case2: Array Index Starting at 1

Given the Preorder traversal of a BST. Draw the BST

vertices , and E is a set of paired vertices, whose elements are called

City - Road Network

Un-weighted Graph Connected Graph

A graph in which all the

Undirected graph that has no loops (edges connected at both ends to

The degree of a vertex of a

In the example, Each vertex has a degree 2

A connected graph is a graph in which it's possible to get from every

--- Adjacent Vertices of A

An adjacency matrix1 is a square matrix used to represent a finite

An edge <A,B> is represented by a ‘1’, in the corresponding cell (A,B)

A ‘0’ indicates that no edge is present between a pair of vertices.

We can either use a list format or an array to represent an edge list

An adjacency list is an array of linked lists that serves as a

Depth First Search(DFS)

Breadth First Search(BFS)

Visited node Output

During DFS, if the stack becomes empty, while there are

Tree Edge Forward Edge

Back Edge Cross Edge

E F Consider the edge FC

Consider the edge FB

ALL NODES ARE

Contact Tracing Knowledge Graphs

Neural Networks Blockchain Networks