Scribd
Upload
14 views10 pages

Toqeer Ahmed DSA Assignment 2

Uploaded by

ta9187208
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
14 views10 pages

Toqeer Ahmed DSA Assignment 2

Uploaded by

ta9187208
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Assignment # 2

Name: Toqeer Ahmed


Roll No: FL-23835
Subject: Data Structure and Algorithms (DSA)
Submitted To: Mr. Qaiser Shehzad
Date: 25th April 2025
Linked List Implementation using Stack
CODE:
#include <iostream>

using namespace std;

class StackNode {

public:

int value;

StackNode* next;

StackNode(int val) {

value = val;

next = nullptr;

};

class LinkedStack {

StackNode* top;

public:

LinkedStack() {

top = nullptr;

bool isEmpty() {

return top == nullptr;

void push(int val) {


StackNode* node = new StackNode(val);

node->next = top;

top = node;

void pop() {

if (isEmpty()) {

cout << "Stack is empty. Cannot pop.\n";

return;

StackNode* temp = top;

top = top->next;

delete temp;

int peek() {

if (isEmpty()) {

cout << "Stack is empty.\n";

return INT_MIN;

return top->value;

void display() {

if (isEmpty()) {

cout << "Stack is empty.\n";

return;

}
StackNode* temp = top;

while (temp != nullptr) {

cout << temp->value << " ";

temp = temp->next;

cout << endl;

};

int main() {

LinkedStack stk;

stk.push(10);

stk.push(20);

stk.push(30);

stk.push(40);

stk.display();

cout << "Top element: " << stk.peek() << endl;

stk.pop();

stk.pop();

stk.display();

cout << "Current top: " << stk.peek() << endl;

return 0;

}
Output:

Linked List Implementation using Queue


CODE:
#include <iostream>

using namespace std;

struct Node {

int data;

Node* next;

Node(int val) : data(val), next(nullptr) {}

};

class Queue {

private:

Node* frontPtr;

Node* rearPtr;
public:

Queue() : frontPtr(nullptr), rearPtr(nullptr) {}

void enqueue(int val) {

Node* newNode = new Node(val);

if (rearPtr == nullptr) {

frontPtr = rearPtr = newNode;

} else {

rearPtr->next = newNode;

rearPtr = newNode;

void dequeue() {

if (frontPtr == nullptr) {

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

return;

Node* temp = frontPtr;

frontPtr = frontPtr->next;

if (frontPtr == nullptr) {

rearPtr = nullptr;

delete temp;

}
int front() {

if (frontPtr == nullptr) {

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

return -1;

return frontPtr->data;

void display() {

Node* temp = frontPtr;

if (!temp) {

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

return;

while (temp != nullptr) {

cout << temp->data << " ";

temp = temp->next;

cout << endl;

bool isEmpty() {

return frontPtr == nullptr;

~Queue() {
while (!isEmpty()) {

dequeue();

};

int main() {

Queue q;

q.enqueue(10);

q.enqueue(20);

q.enqueue(30);

q.display();

cout << "Front element is: " << q.front() << endl;

q.dequeue();

q.display();

cout << "Front element is: " << q.front() << endl;

return 0;

Output:

You might also like