Stack erase

Stack c++

stack<int> stk;
stk.push(5);
int ans = stk.top(5); // ans =5
stk.pop();//removes 5

Stack erase

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

main() {
  struct node {
     int data;
     struct node *next;
  }*pNew,*dltPtr;

  struct stack_ptr {
     int count;
     struct node *top;
  }*stack;
 int i;
 scanf("%d",&i);
 pNew = new node;
 pNew->data = i;
 pNew->next = NULL;
 stack = new stack_ptr;
 stack->count = 1;
 stack->top = pNew;
 scanf("%d",&i);
 while (i != 0){
     pNew = new node;
     pNew->data = i;
     pNew->next = stack->top;
     stack->count++;
     stack->top = pNew;
     scanf("%d",&i);
 } 
 dltPtr = stack->top;
 while (dltPtr != NULL) {
	  printf("% d",dltPtr->data);
	  dltPtr = dltPtr->next;
     } 
 }

Similar codes

3 votes316 views1 answer
Function in struct c++
C++
10 votes359 views3 answers
Remove duplicates from vector c++
C++
9 votes337 views2 answers
Sort vector in reverse order c++
C++
1 vote333 views1 answer
Get window position
C++
1 vote312 views2 answers
Reverse sort cpp
C++
0 vote317 views1 answer
SET TO NULL pointer c++
C++
0 vote356 views1 answer
C++ switch integer
C++
2 votes302 views1 answer
Is javascript for websites only
C++
1 vote342 views1 answer
Isprime c++
C++
22 votes335 views6 answers
Sort array in descending order c++
C++