Scribd
Upload
128 views

Stack by Linked List (By C++) : #Include

This document demonstrates how to implement a stack using a singly linked list in C++. It defines a Node struct with data and link fields, and a top pointer to track the head of the list. Functions like push(), pop(), peek(), isEmpty() and display() are created to add/remove elements and check the status of the stack. The main() function demonstrates using these functions by pushing and popping elements, checking the top value, and printing the stack.

Uploaded by

Sokoine Hamad Denis
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
128 views

Stack by Linked List (By C++) : #Include

This document demonstrates how to implement a stack using a singly linked list in C++. It defines a Node struct with data and link fields, and a top pointer to track the head of the list. Functions like push(), pop(), peek(), isEmpty() and display() are created to add/remove elements and check the status of the stack. The main() function demonstrates using these functions by pushing and popping elements, checking the top value, and printing the stack.

Uploaded by

Sokoine Hamad Denis
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

STACK BY LINKED LIST (By C++)

// C program to Implement a stack


//using singly linked list
#include <bits/stdc++.h> 
using namespace std;
  
// Declare linked list node
  
struct Node {
    int data;
    struct Node* link;
};
struct Node* top;
  
// Utility function to add an element data in the stack
 // insert at the beginning
void push(int data)
{
    // create new node temp and allocate memory
    struct Node* temp;
    temp = new Node();
  
    // check if stack (heap) is full. Then inserting an element would
    // lead to stack overflow
    if (!temp) {
        cout << "\nHeap Overflow";
        exit(1);
    }
  
    // initialize data into temp data field
    temp->data = data;
  
    // put top pointer reference into temp link
    temp->link = top;
  
    // make temp as top of Stack
    top = temp;
}
  
// Utility function to check if the stack is empty or not
int isEmpty()
{
    return top == NULL;
}
  
// Utility function to return top element in a stack
int peek()
{
    // check for empty stack
    if (!isEmpty())
        return top->data;
    else
        exit(1);
}
  
// Utility function to pop top 
// element from the stack
  
void pop()
{
    struct Node* temp;
  
    // check for stack underflow
    if (top == NULL) {
        cout << "\nStack Underflow" << endl;
        exit(1);
    }
    else {
        // top assign into temp
        temp = top;
  
        // assign second node to top
        top = top->link;
  
        // destroy connection between first and second
        temp->link = NULL;
  
        // release memory of top node
        free(temp);
    }
}
  
// Function to print all the 
// elements of the stack 
void display() 
{
    struct Node* temp;
  
    // check for stack underflow
    if (top == NULL) {
        cout << "\nStack Underflow";
        exit(1);
    }
    else {
        temp = top;
        while (temp != NULL) {
  
            // print node data
            cout <<  temp->data << " ";
  
            // assign temp link to temp
            temp = temp->link;
        }
    }
}
  
// Driver Code
int main()
{
    // push the elements of stack
    push(11);
    push(22);
    push(33);
    push(44);
  
    // display stack elements
    display();
  
    // print top elementof stack
    cout << "\nTop element is %d\n" <<  peek();
  
    // delete top elements of stack
    pop();
    pop();
  
    // display stack elements
    display();
  
    // print top elementof stack
    cout << "\nTop element is %d\n" << peek();
    return 0;
  
    // This code has been contributed by Striver 
}
CREATING A LINKED LIST NODES (By JAVA)

public class List


{
Node head;

static class Node


{
int data;
Node next;

Node(int d)
{
data = d;
next = null;
}
}

public static void main(String [] args)


{
List linkedist = new List();

linkedlist.head = new Node();


Node second = new Node();
Node third = new Node();

linkedlist.head.next = second;
second.next = third;
}
}

You might also like