FilesExpand file tree

 main

/

7.Implement_Multiple_Stack.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

127 lines (119 loc) · 2.48 KB

 main

/

7.Implement_Multiple_Stack.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

127 lines (119 loc) · 2.48 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

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

#include <stdio.h>

#include <conio.h>

#define MAX 5

int stack[MAX],topA=-1,topB=MAX;

void pushA(int val)

{

if(topA==topB-1)

printf("\n OVERFLOW");

else

{

topA+= 1;

stack[topA] = val;

}

}

int popA()

{

int val;

if(topA==-1)

{

printf("\n UNDERFLOW");

val = -999;

}

else

{

val = stack[topA];

topA --;

}

return val;

}

void display_stackA()

{

int i;

if(topA==-1)

printf("\n Stack A is Empty");

else

{

for(i=topA;i>=0;i--)

printf("\t %d",stack[i]);

}

}

void pushB(int val)

{

if(topB-1==topA)

printf("\n OVERFLOW");

else

{

topB -= 1;

stack[topB] = val;

}

}

int popB()

{

int val;

if(topB==MAX)

{

printf("\n UNDERFLOW");

val = -999;

}

else

{

val = stack[topB];

topB++;

}

}

void display_stackB()

{

int i;

if(topB==MAX)

printf("\n Stack B is Empty");

else

{

for(i=topB;i<MAX;i++)

printf("\t %d",stack[i]);

}

}

int main()

{

int option, val;

do

{

printf("\n *****MENU*****");

printf("\n 1. PUSH IN STACK A");

printf("\n 2. PUSH IN STACK B");

printf("\n 3. POP FROM STACK A");

printf("\n 4. POP FROM STACK B");

printf("\n 5. DISPLAY STACK A");

printf("\n 6. DISPLAY STACK B");

printf("\n 7. EXIT");

printf("\n Enter your choice:");

scanf("%d",&option);

switch(option)

{

case 1: printf("\n Enter the value to push on Stack A : ");

scanf("%d",&val);

pushA(val);

break;

case 2: printf("\n Enter the value to push on Stack B : ");

scanf("%d",&val);

pushB(val);

break;

case 3: val=popA();

if(val!=-999)

printf("\n The value popped from Stack A = %d",val);

break;

case 4: val=popB();

if(val!=-999)

printf("\n The value popped from Stack B = %d",val);

break;

case 5: printf("\n The contents of Stack A are : \n");

display_stackA();

break;

case 6: printf("\n The contents of Stack B are : \n");

display_stackB();

break;

}

}

while(option!=7);

return(0);

}