Question

I have a queue and stack class program that deals with a palindrome, I need someone to help to put in templates then rerun the code. I'd greatly appreciate it. It's in C++.

Here is my program:

#include<iostream>
#include<list>
#include<iterator>
#include<string>
using namespace std;
class Queue
{
public:
list <char> queue;
Queue()
{
list <char> queue;
}
void Push(char item)
{
queue.push_back(item);
}
char pop()
{
char first = queue.front();
queue.pop_front();
return first;
}
bool is_empty()
{
if(queue.empty())
{
return true;
}
else
{
return false;
}
}
};
class Stack
{
public:
list <char> stack;
Stack()
{
list <char> stack;
}
void Push(char item)
{
stack.push_front(item);
}
char pop()
{
char first = stack.front();
stack.pop_front();
return first;
}
bool is_empty()
{
if(stack.empty())
{
return true;
}
else
{
return false;
}
}
};
bool is_palindrome(string alphabet)
{
Stack stack;
Queue queue;
int i = 0;
while(alphabet[i] != 0)
{
stack.Push(alphabet[i]);
queue.Push(alphabet[i]);
i++;
}
while(!stack.is_empty() && !queue.is_empty())
{
if(stack.pop() != queue.pop())
{
return false;
}
}
return true;
}
int main()
{
string alphabet;
cout << "Please enter the alphabet: \n";
getline (cin, alphabet);
if(is_palindrome(alphabet))
{
cout<<"The given string is a palindrome"<<endl;
}
else
{
cout<<"The given string is not a plaindrome"<<endl;
}

}

Answer 1

// C++ program to create template Stack and template Queue

#include<iostream>

#include<list>

#include<iterator>

#include<string>

using namespace std;

// create a generic Queue class

template <class T>

class Queue

{

private:

               list <T> queue;

public:

               Queue()

               {}

               void Push(T item)

               {

                              queue.push_back(item);

               }

               T pop()

               {

                              T first = queue.front();

                              queue.pop_front();

                              return first;

               }

               bool is_empty()

               {

                              return(queue.empty());

               }

};

// create a generic Stack class

template <class T>

class Stack

{

private:

               list <T> stack;

public:

               Stack()

               {}

               void Push(T item)

               {

                              stack.push_front(item);

               }

               T pop()

               {

                              T first = stack.front();

                              stack.pop_front();

                              return first;

               }

               bool is_empty()

               {

                              return(stack.empty());

               }

};

// function to determine the if the string is a palindrome or not

bool is_palindrome(string alphabet)

{

    // create Stack and Queue of characters

               Stack<char> stack;

               Queue<char> queue;

               int i = 0;

               while(alphabet[i] != 0)

               {

                              stack.Push(alphabet[i]);

                              queue.Push(alphabet[i]);

                              i++;

               }

               while(!stack.is_empty() && !queue.is_empty())

               {

                              if(stack.pop() != queue.pop())

                              {

                                             return false;

                              }

               }

               return true;

}

int main() {

               string alphabet;

               cout << "Please enter the string: \n";

               getline (cin, alphabet);

               if(is_palindrome(alphabet))

               {

                              cout<<"The given string is a palindrome"<<endl;

               }

               else

               {

                              cout<<"The given string is not a palindrome"<<endl;

               }

               return 0;

}

//end of program

Output: