GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Data-Structure-Algorithm/StackUsingLinkedList.cpp at main · aruncode49/Data-Structure-Algorithm

Expand file tree

/

StackUsingLinkedList.cpp

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
103 lines (93 loc) · 1.39 KB
/

StackUsingLinkedList.cpp

Copy path

File metadata and controls

103 lines (93 loc) · 1.39 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include<stdio.h>
#include<iostream>
using namespace std;
struct node
{
int item;
node *next;
};
class Stack
{
private:
node *top;
public:
Stack();
Stack(Stack&);
Stack& operator=(Stack&);
void push(int);
void pop();
int peek();
void reverse();
~Stack();
};
Stack::Stack()
{
top = NULL;
}
Stack::Stack(Stack &s)
{
s.reverse();
node *t = s.top;
while(t)
{
push(t->item);
t = t->next;
}
s.reverse();
}
Stack& Stack::operator=(Stack& s)
{
if(top != NULL)
{
while(top)
pop();
}
s.reverse();
node *t = s.top;
while(t)
{
push(t->item);
t = t->next;
}
s.reverse();
return *this;
}
void Stack::push(int data)
{
node *n = new node;
n->item = data;
n->next = top;
top = n;
}
int Stack::peek()
{
if(top==NULL)
cout<<"Stack Underflow";
else
return top->item;
}
void Stack::pop()
{
if(top != NULL)
{
node *r = top;
top = top->next;
delete r;
}
}
void Stack::reverse()
{
Stack s1;
while(top)
{
s1.push(peek());
pop();
}
top = s1.top;
s1.top = NULL;
}
Stack::~Stack()
{
while(top)
pop();
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.