09 DS and Algorithm Session 13

Data Structures and Algorithms
Objectives
In this session, you will learn to:

Store data in a tree Implement a binary tree Implement a binary search tree
Ver. 1.0
Session 13

Storing Data in a Tree
Directory structure Consider a scenario where you are required to represent the directory structure of your operating system. The directory structure contains various folders and files. A folder may further contain any number of sub folders and files. In such a case, it is not possible to represent the structure linearly because all the items have a hierarchical relationship among themselves. In such a case, it would be good if you have a data structure that enables you to store your data in a nonlinear fashion.
Ver. 1.0
Session 13

Defining Trees
A tree are is a used nonlinear data structure that represent a between Trees in applications in which the relation hierarchical relationship among the various elements. data elements needs to be represented in adata hierarchy.
J L
K M
Ver. 1.0
Session 13

Defining Trees (Contd.)
Each The topmost element node in a tree in a tree is referred is called to root. as a node.
root A
J L
K M node
Ver. 1.0
Session 13

Defining Trees (Contd.)
Each node in a tree can further have subtrees below its hierarchy.
root A
J L
K M node
Ver. 1.0
Session 13

Tree Terminology
Leaf node : It refers to a node with nomost children. Let us discuss various terms that are frequently used with trees.
Nodes E, F, G, H, I, J, L, and M are leaf nodes.
J L
K M
Ver. 1.0
Session 13

Tree Terminology (Contd.)
Subtree: A of a tree, which can be viewed a are Children ofportion a node : The roots of the subtrees of aas node separate in itself is called called thetree children of the node.a subtree.
A subtree can also contain just one node called the leaf node.
A
E, F, with G, and HB, are Tree root children of nodes node B. containing E,B F, is the parent these of G, and H is aof subtree nodes. node A. K L M
Ver. 1.0
Session 13

Degree a from node : It refers number ofis subtrees Edge : A of link the parentto tothe a child node referredof toa as node in a tree. an edge.
B Edge
E F G H
Degree of node C is 1 Degree of node D is 2 Degree of node A is 3 Degree of node B is 4 K L M
Ver. 1.0
Session 13

Siblings/Brothers: It refers to the children of the same node.
Nodes B, C, and D are siblings of each other. Nodes E, F, G, and H are siblings of each other. K L M
Ver. 1.0
Session 13

Internal : It: refers to to any node between the rootof and a Level of node a node It refers the distance (in number leaf node. nodes) of a node from the root. Root always lies at level 0.
As you move down the tree, the level increases by one. A
Level 0
Nodes B, C, D, and K are internal nodes. Level 1
J L
K M
Level 2
Level 3
Ver. 1.0
Session 13

Depth of a tree: Refers to the total number of levels in the tree.

The depth of the following tree is 4.
A
Level 0
Level 1
J L
K M
Level 2
Level 3
Ver. 1.0
Session 13

Just a minute
Consider the following tree and answer the questions that follow:
a. b. c. d. e. f. g. What is the depth of the tree? Which nodes are children of node B? Which node is the parent of node F? What is the level of node E? Which nodes are the siblings of node H? Which nodes are the siblings of node D? Which nodes are leaf nodes?
root
A
B
E I F
C
G
D H
Ver. 1.0
Session 13

Just a minute
Answer:
a. b. c. d. e. f. g. 4 D and E C 2 H does not have any siblings The only sibling of D is E F, G, H, and I
Ver. 1.0
Session 13

Defining Binary Trees
Binary is a specific type of tree in which each node can Strictly tree binary tree: have at most two namely child and child. A binary tree in children which every node, left except for the right leaf nodes, hasare non-empty and of right children. There variousleft types binary trees:
Strictly binary tree Full binary tree Complete binary tree
Ver. 1.0
Session 13

Defining Binary Trees (Contd.)
Full binary tree: d A binary tree of depth d that contains exactly 2 1 nodes.
A
Depth = 3 Total number of 3 nodes = 2 1 = 7

C
Ver. 1.0
Session 13

Defining Binary Trees (Contd.)
Complete binary tree:

A binary tree with n nodes and depth d whose nodes correspond to the nodes numbered from 0 to n 1 in the full binary tree of depth k.
0
B
4 5
C
6 3
B
4 5
C
3
B
4
C
5
Full Binary Tree
Complete Binary Tree
Incomplete Binary Tree
Ver. 1.0
Session 13

Representing a Binary Tree
Array representation of binary trees:

All the nodes are represented as the
A B 0 A D 1 B 2 C E [4] [3] [0] [1]
[2]
If there are n nodes in a binary tree, then for with index elements of any an node array. i, where 0 < i < n 1: Parent of i is at (i 1)/2. Left child of i is at 2i + 1: If 2i + 1 > n 1, then the node does not have a left child. Right child of i is at 2i + 2: If 2i + 2 > n 1, then the node does have a right child.
3
D
4
E
5
F
6
G
F
G
[5]
[6]
Binary Tree
Array Representation
Ver. 1.0
Session 13

Representing a Binary Tree (Contd.)
Linked representation of a binary tree:

It uses a linked list to implement a binary tree. Each node in the linked representation holds the following information:
Data Reference to the left child Reference to the right child
If a node does not have a left child or a right child or both, the respective left or right child fields of that node point to NULL.
Data
Node
Ver. 1.0
Session 13

Representing a Binary Tree (Contd.)
root root
52
.
68
52
.
.
68
36
.
72
24
36
24
59 70
59
.
.
70
72
.
80
80
Binary Tree
Linked Representation
Ver. 1.0
Session 13

Traversing a Binary Tree
You can implement various operations on a binary tree. A common operation on a binary tree is traversal. Traversal refers to the process of visiting all the nodes of a binary tree once. There are three ways for traversing a binary tree:
Inorder traversal Preorder traversal Postorder traversal
Ver. 1.0
Session 13

Inorder Traversal
Steps for traversing a tree in inorder sequence are as follows:

1. Traverse the left subtree 2. Visit root 3. Traverse the right subtree
Let us consider an example.
Ver. 1.0
Session 13

Inorder Traversal (Contd.)
B is is not not NULL. NULL. The left subtree of node A D to traverse the left Therefore, move to node B B. subtree of A.
root A
Ver. 1.0
I
Session 13

The left subtree of node D is NULL. Therefore, visit node D.

root A
D
Ver. 1.0
I
Session 13

Right subtree of D is not NULL Therefore, move to the right subtree of node D
root A
D
Ver. 1.0
I
Session 13

Left subtree of H is empty. Therefore, visit node H.

root A
D
Ver. 1.0
H
Session 13

Right subtree of H is empty. Therefore, move to node B.

root A
D
Ver. 1.0
H
Session 13

The left subtree of B has been visited. Therefore, visit node B.

root A
D
Ver. 1.0
B
Session 13

Right subtree of B is not empty. Therefore, move to the right subtree of B.

root A
D
Ver. 1.0
B
Session 13

Left subtree of E is empty. Therefore, visit node E.

root A
D
Ver. 1.0
E
Session 13

Right subtree of E is empty. Therefore, move to node A.

root A
D
Ver. 1.0
E
Session 13

Left subtree of A has been visited. Therefore, visit node A.

root A
D
Ver. 1.0
A
Session 13

Right subtree of A is not empty. Therefore, move to the right subtree of A.

root A
D
Ver. 1.0
A
Session 13

Left subtree of C is not empty. Therefore, move to the left subtree of C.

root A
D
Ver. 1.0
A
Session 13

Left subtree of F is empty. Therefore, visit node F.

root A
D
Ver. 1.0
F
Session 13

Right subtree of F is empty. Therefore, move to node C.

root A
D
Ver. 1.0
F
Session 13

The left subtree of node C has been visited. Therefore, visit node C.
root A
D
Ver. 1.0
C
Session 13

Right subtree of C is not empty. Therefore, move to the right subtree of node C.
root A
D
Ver. 1.0
C
Session 13

Left subtree of G is not empty. Therefore, move to the left subtree of node G.
root A
D
Ver. 1.0
C
Session 13

Left subtree of I is empty. Therefore, visit I.

root A
D
Ver. 1.0
I
Session 13

Right subtree of I is empty. Therefore, move to node G.

root A
D
Ver. 1.0
I
Session 13

Visit node G.
root A
D
Ver. 1.0
G
Session 13

Right subtree of G is empty.
root A
Traversal complete
G
D
Ver. 1.0
G
Session 13

Preorder Traversal
Steps for traversing a tree in preorder sequence are as follows:

1. Visit root 2. Traverse the left subtree 3. Traverse the right subtree
Ver. 1.0
Session 13

Preorder Traversal (Contd.)
Perform the preorder traversal of the following tree.

A
Preorder Traversal:
A B D H E C F
Ver. 1.0
Session 13

Postorder Traversal
Steps for traversing a tree in postorder sequence are as follows:

1. Traverse the left subtree 2. Traverse the right subtree 3. Visit the root
Ver. 1.0
Session 13

Postorder Traversal (Contd.)
Perform the postorder traversal of the following tree.

A
Postorder Traversal: H D E B F
Ver. 1.0
G C A
Session 13

Just a minute
In _________ traversal method, root is processed before traversing the left and right subtrees.
Answer:
Preorder
Ver. 1.0
Session 13

Implementing a Binary Search Tree
Consider a scenario. SysCall Ltd. is a cellular phone company with millions of customers spread across the world. Each customer is assigned a unique identification number (id). Individual customer records can be accessed by referring to the respective id. These ids need to be stored in a sorted manner in such a way so that you can perform various transactions, such as retrieval, insertion, and deletion, easily.
Ver. 1.0
Session 13

Implementing a Binary Search Tree (Contd.)
Which datayou structure will you use to the id of the Therefore, need to implement a store data structure that customers? provides the advantages of both arrays as well as linked lists. Can you implement an array? Search operation in an array is fast. A binary search tree combines the advantages of both However, insertion arrays and linked lists. and deletion in an array is complex in nature.
In this case, the total number of customer ids to be stored is very large. Therefore, insertion and deletion will be very time consuming.
Can you implement a linked list?

Insert and delete operation in a linked is fast. However, linked lists allow only sequential search. If you need to access a particular customer id, which is located near the end of the list, then it would require you to visit all the preceding nodes, which again can be very time consuming.
Ver. 1.0
Session 13

Defining a Binary Search Tree
The following an is example of a binary search tree. Binary search is tree a binary tree in which every node satisfies the following conditions:
All values in the left subtree of a node are less than the value 52 of the node. All values in the right subtree of a node are greater than the value of the 36 node. 68
24
44
59
72
40
55
Ver. 1.0
Session 13

Defining a Binary Search Tree (Contd.)
You can implement various operations on a binary search tree:

Traversal Search Insert Delete
Ver. 1.0
Session 13

Searching a Node in a Binary Search Tree
Search operation refers value, to the you process of searching for a To search for a specific need to perform the specified steps: value in the tree. following
1. 2. Make currentNode point to the root node If currentNode is null:
a. b. Display Not Found Exit
3.
Compare the value to be searched with the value of currentNode. Depending on the result of the comparison, there can be three possibilities:
a. If the value is equal to the value of currentNode:
i. ii. Display Found Exit Make currentNode point to its left child Go to step 2 Make currentNode point to its right child Go to step 2
b.
If the value is less than the value of currentNode:

i. ii.
c.
If the value is greater than the value of currentNode:

i. ii.
Ver. 1.0
Session 13

Just a minute
In a binary search tree, all the values in the left subtree of a node are _______ than the value of the node.
Answer:
smaller
Ver. 1.0
Session 13

Inserting Nodes in a Binary Search Tree
Before inserting a node in a the binary search you firstto be Write an algorithm to locate position of tree, a new node need to check whether the tree. tree is empty or not. inserted in a binary search If the tree is empty, make the new node as root. If the tree is not empty, you need to locate the appropriate position for the new node to be inserted. This requires you to locate the parent of the new node to be inserted. Once the parent is located, the new node is inserted as the left child or right child of the parent. To locate the parent of the new node to be inserted, you need to implement a search operation in the tree.
Ver. 1.0
Session 13

Inserting Nodes in a Binary Search Tree (Contd.)
1. Mark the root node as currentNode Make parent point to NULL Repeat steps 4, 5, and 6 until currentNode becomes NULL Make parent point to currentNode If the value of the new node is less than that of currentNode: a. Make currentNode point to its left child
Algorithm to locate the parent of the new node to be inserted.

root
2. 3.
4. 5.
52
.
24
36
.
59
68
.
.
72
6.
If the value of the new node is greater than that of currentNode: a. Make currentNode point to its right child
.
80
.
Ver. 1.0
70
Session 13

Locate the position of a new node 55.
Refer to the algorithm to locate the parent of the new node to be inserted.
root
2. 3.
4. 5.
52
.
24
36
.
59
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

2. 3.
root currentNode
4. 5.
52
.
24
36
.
59
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

2. 3.
parent = NULL currentNode
root
4. 5.
52
.
24
36
.
59
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

2. 3.
parent = NULL currentNode
root
4. 5.
52
.
24
36
.
59
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

2. 3.
parent parent= NULL currentNode
root
4. 5.
52
.
24
36
.
59
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

2. 3.
55 > 52
parent currentNode root
4. 5.
52
.
24
36
.
59
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

2. 3.
55 > 52
4. 5.
52
.
24
36
.
59
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

1. Mark the root node as currentNode Make parent point to NULL Repeat steps 4, 5, and 6 until currentNode becomes NULL Make parent point to currentNode If the value of the new node is less than that of currentNode: a. 6. Make currentNode point to its left child
2. 3.
55 > 52
4. 5.
52
.
currentNode
.
24
36
.
59
68
.
.
72
.
80
.
Ver. 1.0
70
Session 13

2. 3.
parent
root
4. 5.
52
.
currentNode
.
24
36
.
59
68
.
.
72
.
80
.
Ver. 1.0
70
Session 13

2. 3.
parent
root
4. 5.
52
.
currentNode
parent
.
24
36
.
59
68
.
.
72
.
80
.
Ver. 1.0
70
Session 13

2. 3.
55 < 68
root
4. 5.
52
.
currentNode
parent
.
24
36
.
59
68
.
.
72
.
80
.
Ver. 1.0
70
Session 13

2. 3.
55 < 68
root
4. 5.
52
.
currentNode
parent
.
24
36
.
59
68
.
.
72
.
80
currentNode
.
Ver. 1.0
70
Session 13

2. 3.
root
4. 5.
52
parent
.
24
36
.
59
68
.
.
72
6.
.
80
currentNode
.
Ver. 1.0
70
Session 13

2. 3.
root
4. 5.
52
parent
.
24
36 parent 59 currentNode
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

2. 3.
55 < 59
root
4. 5.
52
.
24
36 parent 59 currentNode
68
.
.
72
6.
.
80
.
Ver. 1.0
70
Session 13

2. 3.
55 < 59
root
4. 5.
52
.
24
36 parent 59
68
.
.
72
6.
.
80
currentNode currentNode = NULL
70
Ver. 1.0
Session 13

2. 3.
root
4. 5.
52
.
24
36 parent 59
68
.
.
72
6.
.
80
currentNode = NULL
70
Ver. 1.0
Session 13

Once the parent of the new node is located, you can insert the node as the child of its parent.
root
2. 3.
4. 5.
52
.
24
36 parent 59
68
.
.
72
6.
.
80
currentNode = NULL
70
Ver. 1.0
Session 13

Write an algorithm to insert a node in a binary search tree.
Ver. 1.0
Session 13

1. Allocate memory for the new node. Assign value to the data field of new node. Make the left and right child of the new node point to NULL. Locate the node which will be the parent of the node to be inserted. Mark it as parent. If parent is NULL (Tree is empty): a. b. Mark the new node as ROOT Exit 2. 3.
Insert 55 to insert a node Algorithm in a binary search tree.
4.
root
5.
.
.
24 36
52
.
.
68
6.
If the value in the data field of new node is less than that of parent: a. Make the left child of parent point to the new node Exit
59
.
.
70
72
.
7.
b.
If the value in the data field of the new node is greater than that of the parent: a. b. Make the right child of parent point to the new node Exit Session 13
80
Ver. 1.0

1. 2. 3. Allocate memory for the new node. Assign value to the data field of new node. Make the left and right child of the new node point to NULL. Locate the node which will be the parent of the node to be inserted. Mark it as parent. If parent is NULL (Tree is empty): a. b. Mark the new node as ROOT Exit
4.
root
5.
.
.
24 36
52
.
.
68
6.
59
.
.
70
72
.
7.
b.
80
Ver. 1.0

4.
root
5.
.
.
24 36
52
.
.
68
6.
59
.
.
70
72
.
7.
b.
55
80
Ver. 1.0

4.
root
5.
.
.
24 36
52
.
.
68
6.
59
.
.
70
72
.
7.
b.
55
80
Ver. 1.0

4.
root
5.
.
.
24 36
52
.
.
68
6.
parent 59
.
.
70
72
.
7.
b.
55
80
Ver. 1.0

4.
root
5.
.
.
24 36
52
.
.
68
6.
parent 59
.
.
70
72
.
7.
b.
55
80
Ver. 1.0

4.
root
5.
.
.
24 36
52
.
.
68
6.
parent 59
.
.
70
72
.
7.
b.
55
80
Ver. 1.0

4.
root
5.
.
.
24 36
52
.
.
68
6.
parent
.
55
59
.
.
70
72
.
7.
b.
80
Ver. 1.0

4.
root
5.
.
.
24 36
52
.
.
68
6.
parent 59
.
.
70
72
.
7.
b.
55
80
Insert operation complete

Ver. 1.0

Deleting Nodes from a Binary Search Tree
Delete operation into a locate binary the search tree refers to theto Write an algorithm position of the node process from of deleting the specified node from the tree. deleted a binary search tree. Before implementing a delete operation, you first need to locate the position of the node to be deleted and its parent. To locate the position of the node to be deleted and its parent, you need to implement a search operation.
Ver. 1.0
Session 13

Deleting Nodes from a Binary Search Tree (Contd.)
1. Make a variable/pointer currentNode point to the ROOT node. Make a variable/pointer parent point to NULL. Repeat steps a, b, and c until currentNode becomes NULL or the value of the node to be searched becomes equal to that of currentNode: a. Make parent point to currentNode.
Suppose Algorithmyou to locate want to the delete node node to be 70 deleted.

root
2. 3.
. .
24 36
52
. .
59 68
b.
. .
72
If the value to be deleted is less than that of currentNode:

i. Make currentNode point to its left child.
.
80
c.
If the value to be deleted is greater than that of currentNode: i. Make currentNode point to its right child.
.
69
Ver. 1.0
70
Session 13

Suppose you want to delete node 70

root
2. 3.
currentNode
52
. .
59 68
b.
.
24
36
. .
72

.
80
c.
.
69
Ver. 1.0
70
Session 13


root currentNode parent = NULL
2. 3.
52
. .
59 68
b.
.
24
36
. .
72

.
80
c.
.
69
Ver. 1.0
70
Session 13


2. 3.
52
. .
59 68
b.
.
24
36
. .
72

.
80
c.
.
69
Ver. 1.0
70
Session 13


2. 3.
52
parent
b.
.
24
36
.
59
68
. .
72

.
80
c.
.
69
Ver. 1.0
70
Session 13


root currentNode
2. 3.
52
parent
b.
.
24
36
.
59
68
. .

70 > 52
72
.
80
c.
.
69
Ver. 1.0
70
Session 13


root currentNode
2. 3.
52
parent
b.
.
24
36
.
59
68
. .

70 > 52
72
.
80
c.
.
69
Ver. 1.0
70
Session 13


root currentNode
2. 3.
52
parent
currentNode
b.
.
24
36
.
59
68
. .

70 > 52
72
.
80
c.
.
69
Ver. 1.0
70
Session 13


root
2. 3.
. .
24 36
52
parent
currentNode
b.
.
59
68
. .
72

.
80
c.
.
69
Ver. 1.0
70
Session 13


root
2. 3.
. .
24 36
52
parent
currentNode
b.
parent
68
. .
72

59
.
80
c.
.
69
Ver. 1.0
70
Session 13


root
2. 3.
. .
24 36
52
. .
70 > 68
currentNode
b.
parent
68
. .
72

59
.
80
c.
.
69
Ver. 1.0
70
Session 13


root
2. 3.
. .
24 36
52
. .
70 > 68
currentNode
b.
parent
68
. .
72

59
.
80
c.
.
69
Ver. 1.0
70
Session 13


root
2. 3.
. .
24 36
52
. .
70 > 68
currentNode
b.
parent
68
.
currentNode

59
. .
70
72
.
80
c.
69
Ver. 1.0
Session 13


root
2. 3.
. .
24 36
52
. .
68
b.
parent
.
currentNode

59
. .
70
72
.
80
c.
69
Ver. 1.0
Session 13


root
2. 3.
. .
24 36
52
. .
68
b.
parent
.
currentNode

59
. .
70
72
.
80
c.
parent
69
Ver. 1.0
Session 13


root
2. 3.
. .
24 36
52
. .
59 68
70 < 72
b.
.
currentNode

. .
70
72
.
80
c.
parent
69
Ver. 1.0
Session 13


root
2. 3.
. .
24 36
52
. .
59 68
70 < 72
b.
.
currentNode

. .
70
72
.
80
c.
parent
currentNode 69
Ver. 1.0
Session 13


root
2. 3.
. .
24 36
52
. .
59 68
b.
. .
72

.
80
c.
Nodes located
69
Ver. 1.0
parent 70
currentNode
Session 13

Once the nodes are located, there can be three cases:

Case I: Node to be deleted is the leaf node Case II: Node to be deleted has one child (left or right) Case III: Node to be deleted has two children
Ver. 1.0
Session 13

Write an algorithm to delete a leaf node from a binary search tree.
Ver. 1.0
Session 13

1. Locate the node to be deleted. Mark it as currentNode and its parent as parent. If currentNode is the root node: // If parent is // NULL a. b. 3. Make ROOT point to NULL. Go to step 5.
Delete node Algorithm to delete 69 a leaf node from the binary tree.
2.
.
.
24 36
52
.
.
59 68
If currentNode is left child of parent:
. .
72
a.
b.
Make left child field of parent point to NULL. Go to step 5.
.
80
4.
If currentNode is right child of parent: a. Make right child field of parent point to NULL. Go to step 5.
.
69
b.
70
5.
Release the memory for currentNode.
Ver. 1.0
Session 13

Delete node 69
2.
.
.
24 36
52
.
.
59 68
. .
72
a.
b.
.
80
4.
.
69 currentNode
Ver. 1.0
b.
70 parent
5.
Session 13

Delete node 69
2.
.
.
24 36
52
.
.
59 68
. .
72
a.
b.
.
80
4.
.
69 currentNode
Ver. 1.0
b.
70 parent
5.
Session 13

Delete node 69
2.
.
.
24 36
52
.
.
59 68
. .
72
a.
b.
.
80
4.
.
69 currentNode
Ver. 1.0
b.
70 parent
5.
Session 13

Delete node 69
2.
.
.
24 36
52
.
.
59 68
. .
72
a.
b.
.
80
4.
.
69 currentNode
Ver. 1.0
b.
70 parent
5.
Session 13

Delete node 69
2.
.
.
24 36
52
.
.
59 68
. .
72
a.
b.
.
80
4.
.
69 currentNode
Ver. 1.0
b.
70 parent
5.
Session 13

Delete node 69
2.
.
.
24 36
52
.
.
59 68
. .
72
a.
b.
.
80
4.
.
69 currentNode
Ver. 1.0
b.
70 parent
5.
Delete operation complete

Session 13

Write an algorithm to delete a node, which has one child from a binary search tree.
Ver. 1.0
Session 13

1. Locate the node to be deleted. Mark it as currentNode and its parent as parent. If currentNode has a left child: a. Mark the left child of currentNode as child. b. Go to step 4. If currentNode has a right child: a. Mark the right child of currentNode as child. b. Go to step 4. If currentNode is the root node: a. Mark child as root. b. Go to step 7. If currentNode is the left child of parent: a. Make left child field of parent point to child. b. Go to step 7. If currentNode is the right child of parent: a. Make right child field of parent point to child. b. Go to step 7. Release the memory of currentNode. Session 13
Algorithm to delete a node Delete node 80 with one child.

root
2.
. .
24 36
52
.
3.
.
59
68
.
4.
.
70
72
.
5.
.
75
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75 child
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75 child
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75 child
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75 child
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75 child
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75 child
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75 child
80
6.
7.
Ver. 1.0

Delete node 80
2.
root
. .
24 36
52
.
3.
.
59
68
.
parent
4.
.
70
72
.
currentNode 5.
.
75
80
6.

child
Ver. 1.0
7.

Write an algorithm to delete a node, which has two children from a binary search tree.
Ver. 1.0
Session 13

1. Locate the node to be deleted. Mark it as currentNode and its parent as parent. Locate the inorder successor of currentNode. Mark it as Inorder_suc. Execute the following steps to locate Inorder_suc: a. Mark the right child of currentNode as Inorder_suc. b. Repeat until the left child of Inorder_suc becomes NULL: i. Make Inorder_suc point to its left child. Replace the information held by currentNode with that of Inorder_suc. If the node marked Inorder_suc is a leaf node: a. Delete the node marked Inorder_suc by using the algorithm for Case I. If the node marked Inorder_suc has one child: a. Delete the node marked Inorder_suc by using the algorithm for Case II.
Delete node 72 Algorithm to delete a node with two children.

root
2.
. .
24 36
52
. .
68
.
3.
59
.
70
72
. .
80
4.
5.
75
Ver. 1.0
Session 13

Delete node 72
2.
root
. .
24 36
52
.
parent
.
59
68
.
currentNode
3.
.
70
72
. .
80
4.
5.
75
Ver. 1.0
Session 13

Delete node 72
2.
root
. .
24 36
52
.
parent
.
59
68
.
currentNode
3.
.
70
72
. .
80
4.
5.
75
Ver. 1.0
Session 13

Delete node 72
2.
root
. .
24 36
52
.
parent
.
59
68
.
currentNode
3.
.
70
72
. .
80
4.
5.
Inorder_suc 75
Ver. 1.0
Session 13

Delete node 72
2.
root
. .
24 36
52
.
parent
.
59
68
.
currentNode
3.
.
70
72
. .
80
4.
5.
Inorder_suc
75
Ver. 1.0
Session 13

Delete node 72
2.
root
. .
24 36
52
.
parent
.
59
68
.
currentNode
3.
.
70
72
. .
80
4.
5.
Inorder_suc
75
Inorder_suc
Ver. 1.0
Session 13

Delete node 72
2.
root
. .
24 36
52
.
parent
.
59
68
.
currentNode
3.
.
70
72 75
. .
80
4.
5.
75
Inorder_suc
Ver. 1.0
Session 13

Delete node 72
2.
root
. .
24 36
52
.
parent
.
59
68
.
currentNode
3.
.
70
75
. .
80
4.
5.
75
Inorder_suc
Ver. 1.0
Session 13

Delete node 72:

2.
root
. .
24 36
52
.
parent
.
59
68
.
currentNode
3.
.
70
75
. .
80
4.
5.

Inorder_suc
Ver. 1.0
75
Session 13

Activity: Implementing a Binary Search Tree
Problem Statement:
Write a program to implement insert and traverse operations on a binary search tree that contains the words in a dictionary.
Ver. 1.0
Session 13

Summary
In this session, you learned that:

A tree is a nonlinear data structure that represents a hierarchical relationship among the various data elements. A binary tree is a specific type of tree in which each node can have a maximum of two children. Binary trees can be implemented by using arrays as well as linked lists, depending upon requirement. Traversal of a tree is the process of visiting all the nodes of the tree once. There are three types of traversals, namely inorder, preorder, and postorder traversal. Binary search tree is a binary tree in which the value of the left child of a node is always less than the value of the node, and the value of the right child of a node is greater than the value of the node.
Ver. 1.0
Session 13

Summary (Contd.)
Inserting a node in a binary search tree requires you to first locate the appropriate position for the node to be inserted. You need to check for the following three cases before deleting a node from a binary search tree.
If the node to be deleted is the leaf node If the node to be deleted has one child (left or right) If the node to be deleted has two children
Ver. 1.0
Session 13

09 DS and Algorithm Session 13

Uploaded by

Document Information

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

09 DS and Algorithm Session 13

Uploaded by

Copyright:

Available Formats

Data Structures and Algorithms

In this session, you will learn to:

Data Structures and Algorithms

Data Structures and Algorithms

Data Structures and Algorithms

Data Structures and Algorithms

Data Structures and Algorithms

Nodes E, F, G, H, I, J, L, and M are leaf nodes.

Data Structures and Algorithms

Data Structures and Algorithms

Degree of node C is 1 Degree of node D is 2 Degree of node A is 3 Degree of node B is 4 K L M

Data Structures and Algorithms

Siblings/Brothers: It refers to the children of the same node.

Data Structures and Algorithms

Nodes B, C, D, and K are internal nodes. Level 1

Data Structures and Algorithms

Depth of a tree: Refers to the total number of levels in the tree.

Data Structures and Algorithms

Data Structures and Algorithms

Data Structures and Algorithms

Data Structures and Algorithms

Depth = 3 Total number of 3 nodes = 2 1 = 7

Data Structures and Algorithms

Complete binary tree:

Full Binary Tree

Complete Binary Tree

Incomplete Binary Tree

Data Structures and Algorithms

Array representation of binary trees:

Data Structures and Algorithms

Linked representation of a binary tree:

Data Structures and Algorithms

Data Structures and Algorithms

Data Structures and Algorithms

Steps for traversing a tree in inorder sequence are as follows:

Let us consider an example.

Data Structures and Algorithms

Data Structures and Algorithms

The left subtree of node D is NULL. Therefore, visit node D.

Data Structures and Algorithms

Data Structures and Algorithms

Left subtree of H is empty. Therefore, visit node H.

Data Structures and Algorithms

Right subtree of H is empty. Therefore, move to node B.

Data Structures and Algorithms

The left subtree of B has been visited. Therefore, visit node B.

Data Structures and Algorithms

Right subtree of B is not empty. Therefore, move to the right subtree of B.

Data Structures and Algorithms

Left subtree of E is empty. Therefore, visit node E.

Data Structures and Algorithms

Right subtree of E is empty. Therefore, move to node A.

Data Structures and Algorithms

Left subtree of A has been visited. Therefore, visit node A.

Data Structures and Algorithms

Right subtree of A is not empty. Therefore, move to the right subtree of A.

Data Structures and Algorithms

Left subtree of C is not empty. Therefore, move to the left subtree of C.

Data Structures and Algorithms

Left subtree of F is empty. Therefore, visit node F.

Data Structures and Algorithms

Right subtree of F is empty. Therefore, move to node C.

Data Structures and Algorithms

Data Structures and Algorithms