Breaking News: Grepper is joining You.com. Read the official announcement!

stack implementation

Add Answer

JJSE answered on April 30, 2020 Popularity 10/10 Helpfulness 1/10

answer stack implementation

related stack function

related how to implement stack

stack implementation

Comment

typedef struct Nodo{
   Elem val;
   struct Nodo *next;
} *Stack;
Stack Empty(){return NULL;}
bool IsEmpty(Stack a){return a==NULL;}
Elem Top(Stack a){return a->val;} 
Stack Pop(Stack l){return l->next;}
Stack Push(Elem x,Stack res){
    Stack nuevo=(Stack)malloc(sizeof(struct Nodo));
    nuevo->val=x;
    nuevo->next=res;
    return nuevo;
}

Popularity 10/10 Helpfulness 1/10 Language c

Source: Grepper

Tags: c implementation stack

Link to this answer
Share Copy Link

Contributed on Apr 30 2020

JJSE

0 Answers Avg Quality 2/10

Closely Related Answers

stack function

Comment

function Stack() {
  let items = [];

  function push(element) {
    items.push(element);
  }

  function pop() {
    return items.pop();
  }

  function peek() {
    return items[items.length - 1];
  }

  function isEmpty() {
    return items.length === 0;
  }

  function size() {
    return items.length;
  }

  function clear() {
    items = [];
  }

  return {
    clear,
    push,
    pop,
    peek,
    isEmpty,
    size,
  };
}

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.raulmelo.dev

Tags: function functio

Link to this answer
Share Copy Link

Contributed on Aug 18 2022

Pedro Mattos

0 Answers Avg Quality 2/10

how to implement stack

Comment

#include<bits/stdc++.h>
using namespace std;
int Stack[100],n,top,i;

void push(int x) {
   if(top<n-1) {
   	  top++;
      Stack[top]=x; 
   } else {
      cout<<"Could not insert data, Stack is full.\n";
   }
}

int pop() {
	int data;
   if(top>-1) {
      data = Stack[top];
      top = top - 1;   
      return data;
   } else {
      cout<<"Could not retrieve data, Stack is empty.\n";
   }
}

void display()
{
    if(top>=0)
    {
        cout<<"\n The elements in STACK \n";
        for(i=top; i>=0; i--)
           cout<<Stack[i]<<" ";
    }
    else
    {
        cout<<"\n The STACK is empty";
    }
   
}

int main()
{
	cin>>n;
	top=-1;
	push(10);
	push(20);
	push(40);
	push(10);
	cout<<endl<<pop();
	display();
	return 0;
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Apr 12 2022

Motionless Mink

0 Answers Avg Quality 2/10

stack implementation

Contents

More Related Answers

stack implementation

Closely Related Answers

stack function

how to implement stack

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.