Question

Convert following code to implement linked list C++ language

#include<iostream>
using namespace std;
int top = -1; //globally defining the value of top, as the stack is empty

void push(int stack[], int x, int n)
{
if (top == -1) //if top position is the last of posiition of stack,means stack is full
{
cout << "Stack is full Overflow condition";
}
else
{
top = top + 1; //incrementing top position
stack[top] = x; //inserting element on incremented position
}
}
bool isEmpty()
{
if (top == -1) //stack is empty
return true;
else
return false;
}
void pop(int stack[], int n)
{
if (isEmpty())
{
cout << "Stack is empty. Underflow condition" << endl;
}
else
{
top = top - 1; //decrementing tops position will detach last element from stack
}
}
int size()
{
return top + 1;
}
int topElement()
{
return stack[top];
}
//Now lets implementing these functions on the above stack
int main()
{
int stack[3];
push(stack,5, 3); //pushing element 5 in the stack

cout << "Current size of stack is " << size() << endl;

push(stack, 10, 3);
push(stack, 24, 3);

cout << "Current size of stack is " << size() << endl;

//As now the stack is full, further pushing will show overflow condition
push(stack, 12, 3);

//Accesing the top element
cout << "The current top element in stack is" << topElement() << endl;

//now removing all the elements from stack
for (int i = 0; i < 3; i++)
pop();
cout << "Current size of stack is " << size() << endl;

//as stack is empty, now further popping will show underflow condition
pop();

}

switch from stack to linked list

Answer 1

C++ CODE:

/*

*   C++ program to implement a stack using a linked list

*/

#include <iostream>

using namespace std;

// Node of the linked list

struct node{

    int data;

    node *next;

};

//Function to push

node* push(node *top, int num){

    node *newNode = new node;

    newNode->data = num;

    if(top == NULL)

        newNode->next = NULL;

    else

        newNode->next = top;

    top = newNode;

    return top;

}

//Function to check if linked list is empty

bool isEmpty(node *top){

    if(top == NULL)

        return true;

    return false;

}

//Function to pop

node* pop(node *top){

    if(isEmpty(top)){

        cout << "Stack is empty. UnderFlow condition";

        return top;

    }

    struct node *ptr = top;

    top = ptr->next;

    delete ptr;

    return top;

}

// Function to return size of stack

int size(node *top){

    int count = 0;

    for(node *ptr = top; ptr != NULL; ptr = ptr->next)

        count++;

    return count;

}

// Function to return element at top of the stack

int topElement(node *top){

    // If stack is empty then return -1

    if(isEmpty(top))

        return -1;

    return top->data;

}

int main() {

    node *stack = NULL;

    stack = push(stack, 5); //pushing element 5 in the stack

    cout << "Current size of stack is " << size(stack) << endl;

    stack = push(stack, 10);

    stack = push(stack, 24);

    cout << "Current size of stack is " << size(stack) << endl;

    stack = push(stack, 12);

    //Accesing the top element

    cout << "The current top element in stack is " << topElement(stack) << endl;

    //now removing all the elements from stack

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

        stack = pop(stack);

    cout << "Current size of stack is " << size(stack) << endl;

    //as stack is empty, now further popping will show underflow condition

    stack = pop(stack);

    return 0;

}

OUTPUT:

FOR ANY HELP JUST DROP A COMMENT