Stacks Design an ADT for a two-color, T-stack that consists of two stacks - one

Question

Stacks

Design an ADT for a two-color, T-stack that consists of two stacks - one "red" (R) and one "blue"
(B), where T is a template. This ADT uses a single array whose capacity is set to some value N,
where N equals the summation of the size of the red stack and the size of the blue stack. In speci c,
you are asked to design a class called RBStack. It consists of a set of variables and operations as
follows:
Member Variables
T * stackRedBlue ;
int sizeR ;
int sizeB ;
int topR ;
int topB ;
Meber Functions
constructor 1
constructor 2 // copy constructor
destructor
isFull() // is the stack full?
isFullR() // is the red stack full?
isFullB() // is the blue stack full?
isEmpty() // is the stack empty?
isEmptyR() // is the red stack empty?
isEmptyB() // is the blue stack empty?
popR( T & ) // pop an element from the red stack
popB( T & ) // pop an element from the blue stack
popR B(T&, T&) //pop an element from the red stack and an element from the blue stack
pushR( T ) // push a double into the red stack
pushB( T ) // push a double into the blue stack
pushR B( T, T ) // push a double into the rad stack and a double into the blue
stack
printR() // print the red stack
printB() // print the blue stack
- Test ADT by a complete C++ program and PLZ make sure the program compile correctly

Explanation / Answer

Below given is the basic logic of poping and pushing the elements in stack , Use the below logic #include using namespace std; int tp = -1; void pusa (int stack[ ] , int a , int b) { if ( tp == b-1 ) { cout

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.