0

Lab Manual CS301P – Data Structures (Practical)

(Practical)

Page
Lab No. Lab Topic
No.

1 Lab 1: Learn to implement linked list data structure 2

 1

2 Lab 2: Learn to implement stack data structure 11

3 Lab 3: Learn to implement queue data structure 19

4 Lab 4 : Learn to implement Binary Search Tree Data Structure 24

5 Lab 5 : Learn to implement Binary Search Tree Traversals (In-Order,Pre- 31

Order,Post-Order)

6 Lab 6 : Learn to implement function call by value, by reference and by 39

pointer

7 Lab 7: Learn to build/draw AVL tree and understand different types of 43

rotations performed while constructing an AVL tree

8 Lab 8: Learn to build/draw AVL tree 54

9 Lab 9 : Learn to delete nodes from AVL with the help of rotations 55

10 Lab 10 : Learn to build frequency table and Huffman encoding tree 59

11 Lab 11: Learn to implement min heap using insert( ) method 61

12 Lab 12: Learn to implement min heap using buildHeap( ) method 64

13 Lab 13: Learn to a build union tree by using union by size method 67

14 Lab 14:Learn to implement binary search algorithm 70

15 Lab 15 : Build hash table using linear probing collision resolution 72

technique

16 Lab 16: Learn to sort array using elementary sorting algorithms. 73

1|Page
 2

Lab 1
Lab 1 Problem Statement

Lab Title: Learn to implement linked list data structure

Description:

Write a C++ program to create a Linked List that will store and display the data of faculty members
of a university. The user will enter the data of 5 faculty members (name and age). On the basis of
age, the post of the faculty member will be decided and then this data will be added into the linked
list. Each node of the linked list will contain object of Faculty class in data part and next pointer.

Age Criteria for Faculty member’s post:

· Lecturer (if age>=25 and age<=35)

· Assistant Professor (if age>=36 && age<=45)

· Professor (if age>=46 && age<=60)

Structure of Classes:

The program should contain the following classes:

1. Faculty
2. Node
3. List

Faculty Class:

Data Members:

Private variables (string name, int age, string post)

Functions:

Setter and Getter functions

Node Class:

Data Members:

2|Page
 3

Private variables (Faculty object, Node * nextNode)

Functions:

Faculty get()

void set(Faculty object)

Node * getNext()

void setNext(Node * nextNode)

List Class:

Data Members:

Private variables (int size, Node * headNode, Node * currentNode)

Member Functions:

List();

void add (Faculty addObject); (To Add the data of faculty member into
the linked list node)

Faculty get();

bool next();

friend void traverse(List list); (To visit each node and display the data of
a faculty members stored in that node)

Solution :

#include <iostream>

using namespace std;

class Faculty{

string name;

3|Page
 4

string post;

int age;

public:

void setName(string name){

this->name= name;

void setPost(string post){

this->post= post;

void setAge(int age){

this->age=age;

string getName(){

return name;

string getPost(){

return post;

int getAge(){

return age;

4|Page
 5

};

class Node {

public:

Faculty get() {

return object;

void set(Faculty object){

this->object.setName(object.getName());

this->object.setPost(object.getPost());

this->object.setAge(object.getAge());

Node * getNext(){

return nextNode;

void setNext(Node * nextNode){

this->nextNode = nextNode;

private:

Faculty object;

Node * nextNode;

};

5|Page
 6

/* The List class */

class List {

public:

List();

void add (Faculty addObject);

Faculty get();

bool next();

friend void traverse(List list);

private:

int size;

Node * headNode;

Node * currentNode;

};

/* Constructor */

List::List() {

headNode = new Node();

headNode->setNext(NULL);

currentNode = NULL;

size = 0;

6|Page
 7

/* add() class method */

void List::add (Faculty addObject) {

Node * newNode = new Node();

newNode->set(addObject);

if( currentNode != NULL )

newNode->setNext(currentNode->getNext());

currentNode->setNext( newNode );

currentNode = newNode;

else

newNode->setNext(NULL);

headNode->setNext(newNode);

currentNode = newNode;

size ++;

/* get() class method */

Faculty List::get() {

7|Page
 8

if (currentNode != NULL)

return currentNode->get();

/* next() class method */

bool List::next() {

if (currentNode == NULL) return false;

currentNode = currentNode->getNext();

if (currentNode == NULL || size == 0)

return false;

else

return true;

/* Friend function to traverse linked list */

void traverse(List list) {

Node* savedCurrentNode = list.currentNode;

list.currentNode = list.headNode;

cout<<"=============Display Faculty
Information================="<<endl<<endl;

for(int i = 1; list.next(); i++)

{
8|Page
 9

Faculty member;

member=list.get();

cout << "Name : " << member.getName()<<endl;

cout << "Age : " << member.getAge()<<endl;

cout << "Post : " << member.getPost()<<endl;

list.currentNode = savedCurrentNode;

int main() {

Faculty member;

string name,post;

List list;

int age;

cout<<"==============Enter Faculty Information================="<<endl;

for(int a=0;a<5;a++){

cout<<"Enter Faculty Member Age: "<<endl;

cin>>age;

cout<<"Enter Faculty Member Name: "<<endl;

cin>>name;

if(age>=25 && age<=35){

post="Lecturer";

9|Page
 10

else if(age>=36 && age<=45){

post="Assistant Professor";

else if(age>=46 && age<=60){

post="Professor";

member.setName(name);

member.setAge(age);

member.setPost(post);

list.add(member);

traverse(list);

10 | P a g e
 11

Lab 2
Lab Title: Learn to implement stack data structure

Objectives: Get the knowledge of implementing stack data structure using linked list and array
in C++ programming language.

Tool: Dev C++

Description:
Write C++ program to create two stacks (one using linked list and one using array). Both stacks will store
the integer values and display these values in reverse order. In stack implemented through linked list, user
can add any number of nodes but in second stack implemented with array, user will enter only 5 numbers.

Structure of Classes:

The program should contain the following classes:

1- Node
2- Stack_array
3- Stack_linkedlist

Node Class

➔ Two private variables (int object, Node * nextNode)

➔ Functions:
num_get()
num_set(int object)
Node * getNext()
void setNext(Node * nextNode)

Stack_array Class

➔ Four private variables (int object, int current, int size, int A [5])
➔ Functions:
int pop_array ()
void push_array (int x)
int isFull ()
int isEmpty ()

Stack_linkedlist Class
11 | P a g e
 12

➔ one private variable (Node *head)

➔ Functions:
void push(int n);
int pop();

Sample Output:

Note: Numbers must be shown in reverse order only by using pop () method

12 | P a g e
 13

Lab 2 Solution

#include <iostream>

using namespace std;

class Node{

private:

int object;

Node *nextNode;

public:

int num_get() { return object; };

void num_set(int object) { this->object = object; };

Node * getNext() { return nextNode; };

void setNext(Node * nextNode) { this->nextNode = nextNode; };

};

class stack_array

public:

Stack_array() { size = 5; current = -1;} //constructor

int pop_array(){ return A[current--];} // The pop function

void push_array(int x){A[++current] = x;} // The push function

13 | P a g e
 14

int isEmpty(){return ( current == -1 );} // Will return true when stack is empty

int isFull(){ return ( current == size-1);} // Will return true when stack is full

private:

int object; // The data element

int current; // Index of the array

int size; // max size of the array

int A[5]; // Array of 5 elements

};

class stack_linkedlist{

private:

Node *head;

public:

void push_list(int n);

int pop_list();

};

// pushing elements into stack

void stack_linkedlist :: push_list(int n)

Node * newNode = new Node();

14 | P a g e
 15

newNode->num_set(n);

newNode->setNext(head);

head = newNode;

//poping elements from stack and displaying values

int stack_linkedlist ::pop_list()

if(head==NULL){

cout<<"List is empty!"<<endl;

int x =head->num_get();

Node * p = head;

head=head->getNext();

delete p;

cout<<" \n"<< x;

return x;

int main(){

int n=0; // option

int k; // total number to be entered in linked list

int j; // used to push elements in linked list

int m; // used to push elements in linked list

15 | P a g e
 16

stack_linkedlist s;

stack_array sa;

while (n < 5) {

cout << "\n Enter Your Choice \n";

cout << "1 : Add Stack Element in linked list \n";

cout << "2 : Add Stack Element in array \n";

cout << "3 : Pop Stack Elements in linked list and display \n";

cout << "4 : Pop Stack Elements in array and display \n";

cout <<"Enter any other number to Close the program \n";

scanf("%d", &n);

switch (n) {

case 1:

cout << "Enter the total number you want to entered \n";

cin>>k;

cout<<"Please enter the numbers \n";

for(int i = 1; i <= k; i++)

cin>>j;

s.push_list(j); // push the element at the top

cout<<"Numbers added in linked list successfully \n";

16 | P a g e
 17

break;

case 2:

if(sa.isFull()) // checking stack is full or not

cout <<"\n Stack is full, can't insert new element";

else {

cout<<"You can enter 5 numbers only in array \n";

for(int i = 0; i < 5; i++)

cin>>m;

sa.push_array(m); // push the element at the top

break;

case 3:

cout<<"The reverse of input in linked list is"<<"\n";

for(int i =1; i <= k; i++)

s.pop_list();

break;

case 4:

cout<<"The reverse of input in array is"<<"\n";

for (int i = 0; i < 5; i++)

17 | P a g e
 18

if(!sa.isEmpty()) // checking stack is empty or not

cout << "\n " << sa.pop_array();

else

cout <<"\n Stack is empty, can't pop";

default :

break;

return 0;

18 | P a g e
 19

Lab 3
Lab Title: Learn to implement queue data structure

Objectives: Get the knowledge of implementing queue data structure using linked list in C++
programming language.

Tool: Dev C++

Description:
Write a C++ program to create a queue (using linked list), Your program should meet the following
requirements:

1. The queue will store only even numbers and just display those numbers without removing them.
2. Then you have to delete the first even element from the queue and show the remaining numbers of
queue.

Structure of Classes:

The program should contain the following classes:

4- Node
5- Queue

Node Class

➔ Two private variables (int object, Node * nextNode)

➔ Functions:
int get ()
void set (int object)
Node * getNext()
void setNext(Node * nextNode)

Queue Class

➔ Two public variables (Node *front, *rear)

➔ Functions:
void enqueue (int x);
int dequeue ();
void display ();
int isEmpty();

19 | P a g e
 20

Sample Output:

Solution

//Implementation of Queue using Linked List

#include<iostream>

using namespace std;

class Node{

public:

int get() { return object; };

void set(int object) { this->object = object; };

Node * getNext() { return nextNode; };

setNext(Node * nextNode) { this->nextNode = nextNode; };

int object;

Node *nextNode;

20 | P a g e
 21

};

class Queue{

public:

Node *front,*rear;

void enqueue(int x);

int dequeue();

void display();

int isEmpty();

};

int Queue::isEmpty()

return (front == NULL );

//Insert an element into Queue

void Queue::enqueue(int x) {

Node* newNode = new Node();

newNode->set(x);

newNode->setNext(NULL);

//for first node

if(front==NULL){

front=rear=newNode;

else{

rear->setNext(newNode);
21 | P a g e
 22

rear=newNode;

void Queue::display(){

if(isEmpty()) {

cout<<"Queue is empty."<<endl;

return;

Node *temp=front;

//will check until NULL is not found

while(temp != NULL){

cout<<temp->object<<" \n";

temp=temp->nextNode;

//Removing elements from Queue

int Queue :: dequeue()

int x = front->get();

Node* p = front;

front = front->getNext();

delete p;

return x;

22 | P a g e
 23

int main(){

int n,k;

Queue Q;

cout << "Enter the total numbers you want to enter \n";

cin>>k;

cout<<"Enter numbers randomly \n";

for(int i = 1; i <= k; i++)

cin>>n;

if(n%2==0)

Q.enqueue(n);// calling Enqueue for insertion

cout<<"The even numbers are \n";

Q.display();

Q.dequeue(); // calling dequeue

cout<<"After Removing the first Even number\n";

Q.display();

return 0;

23 | P a g e
 24

Lab 4
Lab Title: Learn to implement Binary Search Tree Data Structure

Objectives: Get the knowledge of how to construct a Binary Search Tree and perform basic
functions on a BST in C++ programming language.

Tool: Dev C++

Description:
Consider the following string array in which different names are stored. The length of each name is different
from the others.

➔ string names [] = {"Saleh","Ali","Umar","Musaddiq","Rehman","Hassaan"};

Write a C++ program to construct a Binary Search Tree which will store the length of each name in its
nodes. For example, the length of “Ali” is 3 so 3 will be inserted in BST node. After the construction of
BST, you are required to print the values of maximum and minimum nodes of Binary Search Tree.

Your program should meet the following requirements.

1. You will use the same string array mentioned above.

2. Calculate the length of each name and store them in an integer array treeData.
3. Construct the Binary Search Tree by inserting the values stored in treeData.
4. While inserting the nodes in BST, print each name with its length.
5. The insert method should be able to prevent the entry of duplicate value in BST.
6. The program should be able to print the node having maximum and minimum value.

Structure of Program:

Your program should contain the following:

1) A template class BSTNode to create nodes of BST

2) Non-member functions

24 | P a g e
 25

Sample Output:

Solution

#include <iostream>
#include <stdlib.h>
#include <conio.h>

using namespace std;

template <class Object>

class BSTNode{
25 | P a g e
 26

public:

BSTNode() {
this->object = NULL;
this->left = NULL;
this->right = NULL;
};

BSTNode(Object *object ) {
this->object = object;
this->left = NULL;
this->right = NULL;
};

Object *getInfo() {
return this->object;
};

void setInfo(Object *object) {

this->object = object;
};

BSTNode *getLeft() {
return left;
};
void setLeft(BSTNode *left) {
this->left = left;
};
BSTNode *getRight() {

26 | P a g e
 27

return right;
};
void setRight(BSTNode *right) {
this->right = right;
};

int isLeaf( ) {
if(this->left == NULL && this->right == NULL)
return 1;
return 0;
};

private:
Object *object;
BSTNode *left;
BSTNode *right;

};

void insert(BSTNode <int> *root, int *info) {

BSTNode <int> *node = new BSTNode <int> (info);
BSTNode <int> *a, *b;
a = b = root;
while(*info != *(a->getInfo()) && b != NULL) {
a = b;
if(*info < *(a->getInfo()))
{
b = a->getLeft();

27 | P a g e
 28

}
else {
b = a->getRight();
}
}
if(*info == *( a->getInfo()) ) {
cout<<endl<<endl<<*info<<"is duplicate in this Binary Search Tree (BST). Can not be inserted .... ";
getch();
delete node;
}
else if( *info < *(a->getInfo()) ) {
a->setLeft(node);
}

else {
a->setRight(node);
}
cout<<endl;
}

int minNode(BSTNode<int>* treeNode) {

while (treeNode->getLeft() != NULL) {
treeNode = treeNode->getLeft();
}
return *treeNode->getInfo();
}

int maxNode(BSTNode<int>* treeNode) {

28 | P a g e
 29

while (treeNode->getRight() != NULL) {

treeNode = treeNode->getRight();
}
return *treeNode->getInfo();
}

int main() {
string names [] = {"Saleh","Ali","Umar","Musaddiq","Rehman","Hassaan"};
int totalNames = sizeof(names)/sizeof(names[0]);
BSTNode <int> *NTree = new BSTNode<int>();
int treeData[totalNames];
totalNames++;
for(int a=0;a<totalNames;a++){
if(a==6){
treeData[a]=-1;
}
else{
treeData[a]= names[a].length();
}
}
NTree->setInfo( &treeData[0] );
cout << "Inserting the length of names in BST Nodes one by one" <<endl;
cout << "-------------------------------------------------------------" << endl;
cout<<"Length of "<<names[0]<<" is: "<<*NTree->getInfo( )<<endl;
for(int i = 1; treeData[i] > 0; i++) {
cout<<"Length of "<<names[i]<<" is: "<<treeData[i];
insert(NTree, &treeData[i]);
}
cout<<"\nValue of BST minumum node is: "<<minNode(NTree)<<endl;

29 | P a g e
 30

cout<<"Value of BST maximum node is: "<<maxNode(NTree)<<endl;

return 0;
}

30 | P a g e
 31

Lab 5
Lab Title: Learn to implement Binary Search Tree Traversals (In-Order,Pre-Order,Post-Order)

Objectives: Get the knowledge of how to implement Binary Search Tree with character data
type and perform different traversal methods on a BST in C++ programming language.

Tool: Dev C++

Description:
Write a C++ program that stores the name of a person and build the binary search tree from the
characters of that name. After the construction of the Binary Search Tree, print the characters of name
in pre-order, post-order, and in-order traversal.

Your program should meet the following requirements.

1. First, you will enter the length of the name.

2. Enter the name that will be stored in a character array.
3. Construct the Binary Search Tree by inserting the values stored in the character array.
4. The insert method should not enter the duplicate character in binary tree, you can enter the name
that contain different characters only.
5. After the construction of Binary tree, the program should be able to print the characters in pre-
order, post order, and in-order traversal of the name entered by the user.

Structure of Classes:

The program should contain the following class:

6- TreeNode

TreeNode Class

➔ Three private variables (object* object, TreeNode * left, TreeNode*right)

➔ Functions:
TreeNode (Object* object)
Object* getInfo ()
void setInfo (Object* object)
TreeNode* getLeft ()
void setLeft (TreeNode* left)
TreeNode* getRight ()
void setRight (TreeNode* right)
int isLeaf ()

31 | P a g e
 32

Non-Member functions

➔ void insert (TreeNode<char>* root, char* info)

➔ void inorder (TreeNode<char>* treeNode)
➔ void preorder (TreeNode<char>* treeNode)
➔ void postorder (TreeNode<char>* treeNode)
➔ main ()

Sample Output:

Solution

#include <iostream>

#include <cstring>

using namespace std;

template <class Object>

class TreeNode {

public:

// constructors

TreeNode()

32 | P a g e
 33

this->object = NULL;

this->left = this->right = NULL;

};

TreeNode(Object* object)

this->object = object;

this->left = this->right = NULL;

};

Object* getInfo()

return this->object;

};

void setInfo(Object* object)

this->object = object;

};

TreeNode* getLeft()

33 | P a g e
 34

return left;

};

void setLeft(TreeNode* left)

this->left = left;

};

TreeNode* getRight()

return right;

};

void setRight(TreeNode* right)

this->right = right;

};

int isLeaf()

34 | P a g e
 35

if (this->left == NULL && this->right == NULL)

return 1;

return 0;

};

private:

Object* object;

TreeNode* left;

TreeNode* right;

}; // end class TreeNode

void insert(TreeNode<char>* root, char* info)

TreeNode<char>* node = new TreeNode<char>(info);

TreeNode<char> *p, *q;

p = q = root;

while (*info != *(p->getInfo()) && q != NULL) {

p = q;

if (*info < *(p->getInfo()))

q = p->getLeft();

else

35 | P a g e
 36

q = p->getRight();

if (*info == *(p->getInfo())) {

cout << "attempt to insert duplicate: " << *info << endl;

delete node;

else if (*info < *(p->getInfo()))

p->setLeft(node);

else

p->setRight(node);

void inorder(TreeNode<char>* treeNode)

if (treeNode != NULL) {

inorder(treeNode->getLeft());

cout << *(treeNode->getInfo()) << " ";

inorder(treeNode->getRight());

} //End of inOrder.

36 | P a g e
 37

void preorder(TreeNode<char>* treeNode)

if( treeNode != NULL )

cout << *(treeNode->getInfo())<<" ";

preorder(treeNode->getLeft());

preorder(treeNode->getRight());

} //End of preorder

void postorder(TreeNode<char>* treeNode)

if( treeNode != NULL )

postorder(treeNode->getLeft());

postorder(treeNode->getRight());

cout << *(treeNode->getInfo())<<" ";

}// End of post order

int main()

37 | P a g e
 38

int length;

TreeNode<char>* root = new TreeNode<char>();

cout<<"Enter the length of a name =";

cin>>length;

char* word = new char[length];

int i;

cout<<"Enter the name: ";

for(int i=0;i<length;i++)

cin>>word[i];

root->setInfo(&word[0]);

for (int i = 1; word[i]!='\0'; i++) {

insert(root, &word[i]);

cout << "\n Inorder: ";

inorder(root);

cout << "\n preorder: ";

preorder( root);

cout << "\n postorder: ";

postorder( root );

return 0;

} // end of main.

38 | P a g e
 39

Lab 6
Lab 6 Problem Statement

Lab Title: Learn to implement function call by value, by reference and by pointer

Description:

Write C++ program to swap the values of two variables of different data types using different
function calls. Your program should swap the values using function call by value, reference and
pointers. The swapping functions should receive the swapping variables as arguments. The
functions should be declared as template functions so that they can entertain any data type.

Structure of Program:

The program should contain the following functions:

4. void swapping_by_value (T obj1, T obj2)

5. void swapping_by_reference (T& obj1, T& obj2)
6. void swapping_by_pointers (T* obj1, T* obj2)

Sample Output:

39 | P a g e
 40

Solution

#include <iostream>

using namespace std;

template<class T>

void swapping_by_value(T obj1, T obj2) {

T temp = obj1;

obj1 = obj2;

obj2 = temp;

template<class T>

void swapping_by_reference(T& obj1, T& obj2) {

T temp = obj1;

obj1 = obj2;

obj2 = temp;

template<class T>

void swapping_by_pointers(T* obj1, T* obj2){

T temp= *obj1;

*obj1 = *obj2;

*obj2 = temp;

40 | P a g e
 41

int main(){

int a=5,b=10;

cout<<"=============Function Call by Value============="<<endl<<endl;

cout<<"Before Swapping"<<endl;

cout<<"a = "<<a<<endl;

cout<<"b = "<<b<<endl;

swapping_by_value(a,b);

cout<<"After Swapping thorugh function call by value no effect on values of A,B"<<endl;

cout<<"a = "<<a<<endl;

cout<<"b = "<<b<<endl;

cout<<"=============Function Call by Reference============="<<endl<<endl;

cout<<"Before Swapping"<<endl;

cout<<"a = "<<a<<endl;

cout<<"b = "<<b<<endl;

swapping_by_reference(a,b);

cout<<"After Swapping thorugh function call by refrence"<<endl;

cout<<"a = "<<a<<endl;

cout<<"b = "<<b<<endl;

cout<<"=============Function Call by Pointers============="<<endl<<endl;

cout<<"Before Swapping"<<endl;

cout<<"a = "<<a<<endl;

41 | P a g e
 42

cout<<"b = "<<b<<endl;

swapping_by_pointers(&a,&b);

cout<<"After Swapping thorugh function call by pointers"<<endl;

cout<<"a = "<<a<<endl;

cout<<"b = "<<b<<endl;

return 0;

42 | P a g e
 43

Lab 7
Lectures Covered: 19-22

Lab 7 Problem Statement

Lab Title: Learn to draw AVL Tree.

Objectives: Learn to build/draw AVL tree and understand different types of rotations performed
while constructing an AVL tree.

Tool: MS Word, MS Visio or any other online diagram making tool

Description:

You are required to construct AVL tree from the following data:

15 ,18 ,12, 8, 54, 5, 14, 13, 9, 61, 20, 17, 21

Solution:

43 | P a g e
 44

44 | P a g e
 45

45 | P a g e
 46

46 | P a g e
 47

47 | P a g e
 48

48 | P a g e
 49

49 | P a g e
 50

50 | P a g e
 51

51 | P a g e
 52

52 | P a g e
 53

53 | P a g e
 54

Lab 8
Lab Title: Learn to draw AVLtree

Lectures Covered: 19-22

Objectives: Learn to build/draw AVL tree and understand different types of rotations

Tool: MS Word, MS Visio

Description:
Build AVL tree from the given Data: 3 5 6 7 9 10 11 21 20 18 19

Note: You have to show only final AVL tree after insertion of each node value.

54 | P a g e
 55

Lab 9
Lab Title: Learn to delete nodes from AVL tree

Objectives: Learn to delete nodes from AVL with the help of rotations

Tool: MS Word, MS Visio

Description:
Delete the node 8,7,11,14,17 from given AVL tree and perform necessary rotation(s) to balance
the tree after deletion of each node. Show final tree after each deletion.

Solution

Delete Node 8

55 | P a g e
 56

No effect on tree after Node 8 deletion, the tree is balanced. Now we have to delete Node 7

After deleting node 7 the node 4 becomes left child of node 11 and tree is still balanced after deletion

Now we have to delete node 11. The following will be the resultant tree after node 11 Deletion , Node
4 has replaced the node 11

56 | P a g e
 57

Now if we check the balance after deletion we find that tree is not balanced . Node 4 is unbalanced and
hence rotation is required . Here we will apply Left rotation

After Applying left rotation following tree is achieved which is balanced

Now we have to delete node 14 . After deleting Node 14 it will be replaced by node node 13. Node 13
will now be the parent node. The tree is balanced after deletion of Node 14

57 | P a g e
 58

Now we have to make the final deletion I.e. Node 17. After deletion of Node 17 it will be replaced by
Node 16 . This is our final tree

58 | P a g e
 59

Lab 10
Lab Title: Learn to build frequency table and Huffman encoding tree

Objectives: Get the knowledge of building frequency table and Huffman encoding tree.

Tool: MS Word, MS Visio

Description:
Consider the message “the clouds are dark and its about to rain” and construct frequency
table and Huffman encoding tree.

Frequency Table:

Character Frequency Character Frequency

a 5 n 2
b 1 o 3
c 1 r 3
d 3 s 2
e 2 t 4
h 1 u 2
i 2 SP 8
k 1 NL 1
l 1

Huffman Encoding Tree:

59 | P a g e
 60

0 4
1

1 2
0
1 0 1

7 7 1 1
0 1 0 1 0 0
1 1

r 4 o 4 S 7 a 8

0 1 0 1 1 0 1
0

s 2 n 2 d 4 t 4

0 1 0 1 0 1
0 1

b c h k i 2
u e
0 1

l N

60 | P a g e
 61

Lab 11
Lab Title: Learn to implement min heap using insert( ) method

Objectives: Get the knowledge of implementing min heap using insert( ) method with the help
of C++ programming language.

Tool: Dev C++

Description:
Consider the Data: 18, 31, 82, 85, 37, 20, 23, 79, 47, 51, 96, 97, 42, 94, 57, 29 and write the C++
code to construct min heap using insert method.

Solution:

#include <iostream>

using namespace std;

class Heap {

public:

Heap (int capacity);

bool insert ( const int& x);

bool isEmpty ();

bool isFull();

void traverse();

public:

int currentSize; // number of elements in heap

int * array; // the heap array

int capacity;

};

61 | P a g e
 62

Heap::Heap (int capacity) {

array = new int[capacity+1];

currentSize = 0;

bool Heap::insert ( const int& x) {

if(isFull()) {

cout<<endl<<"cannot insert Heap is full!!" <<endl;

return 0;

int hole = ++currentSize;

for(/* declaration is above*/ ; hole>1 && x< array[hole/2]; hole /= 2) {

array[hole]= array[hole/2];

array[hole] = x;

void Heap::traverse() {

for (int i = 1; i <= currentSize; i++)

cout<<" "<< array[i] << " ";

bool Heap::isEmpty() {

return currentSize == 0;

bool Heap::isFull() {

62 | P a g e
 63

return currentSize==capacity;

main() {

int size = 16, arr[size] = {18, 31, 82, 85, 37, 20, 23, 79, 47, 51, 96, 97, 42, 94, 57, 29};

Heap heap(size);

for (int i = 0; i< size; i++)

heap.insert(arr[i]); // insert number into heap one by one

cout<< " Min Heap using insert method : "<<endl;

heap.traverse();

63 | P a g e
 64

Lab 12
Lab Title: Learn to implement min heap using buildHeap( ) method

Objectives: Get the knowledge of implementing min heap using buildHeap( ) and
perculateDown( ) methods with the help of C++ programming language.

Tool: Dev C++

Description:
Consider the Data: 18, 31, 82, 85, 37, 20, 23, 79, 47, 51, 96, 97, 42, 94, 57, 29 and write the C++
code to construct min heap using buildHeap( ) method.

#include <iostream>

using namespace std;

Solution

class Heap {

public:

Heap (int capacity);

bool isEmpty ();

bool isFull();

void buildHeap(int * anArray, int n);

void traverse();

public:

int currentSize; // number of elements in heap

int * array; // the heap array

int capacity;

64 | P a g e
 65

void percolateDown( int hole );

};

Heap::Heap (int capacity) {

array = new int[capacity+1];

currentSize = 0;

void Heap::percolateDown(int hole) {

int child;

int temp = array[hole];

for ( /*nothing*/ ; hole * 2 <=currentSize; hole = child) {

child = hole*2;

if (child !=currentSize&& array[child+1] < array[child] )

child++;

if (array[child]< temp)

array[hole] = array[child];

else break;

array[hole] = temp;

void Heap::buildHeap(int * anArray, int n) {

for (int i = 1; i<= n ; i++ )

65 | P a g e
 66

array[i] = anArray[i-1];

currentSize = n;

for (int i =currentSize/2; i>0; i--)

percolateDown(i);

void Heap::traverse() {

for (int i = 1; i<=currentSize; i++)

cout<<" "<< array[i] << " ";

bool Heap::isEmpty() {

return currentSize == 0;

bool Heap::isFull() {

return currentSize==capacity;

main() {

int size = 16, arr[size] = {18, 31, 82, 85, 37, 20, 23, 79, 47, 51, 96, 97, 42, 94, 57, 29};

Heap heap(size);

heap.buildHeap(&arr[0],size);

cout<< "\n Min Heap using build method: "<<endl;

heap.traverse();

66 | P a g e
 67

Lab 13
Lab Title: Learn to a build union tree by using union by size method

Objectives: Get the knowledge of building union tree of any given data with the help of union
by size method.

Tool: MS Word, MS Visio

Description:
Consider the following set of elements,

Apply the following sequence of union commands on the above set of elements and draw the
tree by using the union by size method. Show the resultant tree only. Also, update the given
array by the union of size method.

• union (2,6)
• union (1,3),
• union (4,2)
• union (1,2)
• union (5,2)

Solution:

• union (2,6)

67 | P a g e
 68

-1 -2 -1 -1 -1 2 -1 -1
1 2 3 4 5 6 7 8

• union (1,3)

-2 -2 1 -1 -1 2 -1 -1
1 2 3 4 5 6 7 8

union (4,2)

4 6

-2 -3 1 2 -1 2 -1 -1

68 | P a g e
 69

1 2 3 4 5 6 7 8

• union (1,2)

4 6 3

2 -5 1 2 -1 2 -1 -1
1 2 3 4 5 6 7 8

• union (5,2)

2
5
1

4 6 3

2 -6 1 2 2 2 -1 -1
1 2 3 4 5 6 7 8

69 | P a g e
 70

Lab 14
Lab 14 (Lectures Covered 38-40)

Lab Title: Learn to implement binary search algorithm

Description:

Write a program in C++ language to find a number (element) from an array using binary search
algorithm. Your program should start search from the first element of array and it should search
every third element of the array.

You can use 18, 20, 23, 31, 37, 42, 47, 51, 79, 82, 85, 94, 96, 97 as data of array.

Solution :

#include <iostream>

using namespace std;

int isPresent(int arr[], int val, int N){

int low = 0,high = N - 1,mid;

while ( low <= high ){

mid = ( low + high )/2;

if (arr[mid] == val)

return 1;

else if (arr[mid] < val)

low = mid + 1;

else

high = mid - 1;

return 0;

}
70 | P a g e
 71

int main() {

int size = 14, arr[size] = {18, 20, 23, 31, 37, 42, 47, 51, 79, 82, 85, 94, 96, 97};

for(int i=0;i<=13;i+=3){

int result = isPresent(arr,arr[i],size);

if(result == 1)

cout<<"Element = "<<arr[i]<<", Index = "<<i<<endl;

else

cout<<"Element is not present in array"<<endl;

return 0;

71 | P a g e
 72

Lab 15
Lab Title: Build hash table using linear probing collision resolution technique

Objectives: Learn to build Hash table using linear probing technique to resolve collision

Tool: MS Word

Description:
Insert the values 1, 2, 9, 11,7 into the following table using hash function (2x + 3)mod8. You
have to apply linear probing technique to resolve collision.

Solution:
0

1 11

2 7

5 1

6 9

7 2

72 | P a g e
 73

Lab 16
Lab Title: Learn to sort array using elementary sorting algorithms.

Objectives: Get the knowledge of sorting array using Selection Insertion, and Bubble sort
algorithm.

Tool: MS Word

Description:
Consider the data given below as an array and sort by implementing selection, insertion, and
bubble sort algorithm.

Selection Sort Algorithm:

You are required to sort the given data in ascending order using selection sort.
8 5 10 3 1

0 1 2 3 4
Solution:

Step 1:
1 5 10 3 8

0 1 2 3 4
Step 2:
1 3 10 5 8

0 1 2 3 4
Step 3:
1 3 5 10 8

0 1 2 3 4
Step 4:
1 3 5 8 10

73 | P a g e
 74

0 1 2 3 4

Insertion Sort Algorithm:

You are required to sort the given data in ascending order using insertion sort algorithm

10 4 8 16 11

Solution:

List: 10 4 8 16 11

Step1: 4 10 8 16 11

Step2: 4 8 10 16 11

Step3: 4 8 10 16 11

Step4: 4 8 10 11 16

Bubble Sort Algorithm:

Suppose, we have been given the following array.

6 1 3 2 9

0 1 2 3 4
You are required to sort the above data in ascending order using Bubble sort..
Solution:

1st iteration:

Step 1:
6 1 3 2 9

0 1 2 3 4
Step 2:
1 6 3 2 9

0 1 2 3 4
74 | P a g e
 75

Step 3:
1 3 6 2 9

0 1 2 3 4
Step 4:
1 3 2 6 9

0 1 2 3 4

Step 5:
1 3 2 6 9

0 1 2 3 4

2nd iteration:

Step 1:
1 3 2 6 9

0 1 2 3 4

Step 2:
1 3 2 6 9

0 1 2 3 4

Step 3:
1 2 3 6 9

0 1 2 3 4

Step 4:
1 2 3 6 9

0 1 2 3 4

Step 5:
1 2 3 6 9

75 | P a g e
 76

0 1 2 3 4

76 | P a g e