Question

This a lab for C++ using visual studio 2017

Lab 10
Total 50 points
Stacks and Queues - Part A (40 points)
Finish the code for Lab10aStacksAndQueues.cpp . You will write code for the same function which will return
true if the values of the elements of the vector that is passed to it are the same read both forwards and
backwards. If they are not the same in both directions, it will return false. Don’t change anything in the
main function or add any additional functions to the program.

The provided .cpp code is below

// Lab10a Stacks and Queues

#include

#include

#include

#include

#include

using namespace std;

template

bool Same(vector tVector);

int main()

{

const int SIZE_INT = 8;

const int SIZE_STRING = 6;

int iTemp1[]= {1,1,2,3,3,2,1,1};

int iTemp2[]= {1,1,2,3,2,3,1,1};

vector iVector1(iTemp1, iTemp1 + SIZE_INT);

vector iVector2(iTemp2, iTemp2+ SIZE_INT);

string sTemp1[]= {"aa", "bb", "cc", "cc", "bb", "aa"};

string sTemp2[]= {"aa", "bb", "cc", "bb", "cc", "aa"};

vector sVector1(sTemp1, sTemp1 + SIZE_STRING);

vector sVector2(sTemp2, sTemp2 + SIZE_STRING);

if (Same(iVector1))

cout << "iVector1 values are in the same order forwards and backwards\n";

else

cout << "iVector1 values are NOT in the same order forwards and backwards\n";

if (Same(iVector2))

cout << "iVector2 values are in the same order forwards and backwards\n";

else

cout << "iVector2 values are NOT in the same order forwards and backwards\n";

if (Same(sVector1))

cout << "sVector1 values are in the same order forwards and backwards\n";

else

cout << "sVector1 values are NOT in the same order forwards and backwards\n";

if (Same(sVector2))

cout << "sVector2 values are in the same order forwards and backwards\n";

else

cout << "sVector2 values are NOT in the same order forwards and backwards\n";

system("pause");

return 0;

}

template

bool Same(vector tVector)

{

/* Write the code for this function. You must use one STL stack of

* type T and one STL queue of type T. You should not have more than 15 lines of

* code total.

*/

/* steps:

create a queue

create a stack

push into stack

push into queue

compare the stack and queue "output" when you pop it

*/

}

Trees - Part B (10 points)
Please complete the program below exactly as described. Don’t add anything extra to it (methods, extra
variables, features, etc.) and don’t leave any features described below out.
You are going to write a function that will use recursion to count the number of nodes in a tree. First use the code in the
text book (pg. 1141-1142 for 7th Edition or pg. 1159 for 8th Edition) to develop the IntBinaryTree class (For the
member functions, you only need the code for the constructor and the insert member function). Your main program will
call a public member function called numNodes. This function will then call a private member function, countNodes,
which will use recursion to count the number of nodes in the entire tree:
int IntBinaryTree::countNodes(TreeNode *nodePtr)
{
if (nodePtr == NULL)
//write only one line of code here
else
//write only one line of code here
}
int main()
{
IntBinaryTree tree;

tree.insertNode(14);
tree.insertNode(10);
tree.insertNode(8);
tree.insertNode(6);
tree.insertNode(5);
tree.insertNode(7);
tree.insertNode(9);
tree.insertNode(12);
tree.insertNode(11);
tree.insertNode(13);
tree.insertNode(22);
tree.insertNode(30);
tree.insertNode(32);
tree.insertNode(24);
tree.insertNode(20);
tree.insertNode(17);
tree.insertNode(15);
tree.insertNode(18);
tree.insertNode(21);
cout <<"The number of nodes in the tree is: " << tree.numNodes()< system (“Pause”);
return 0;
}
Note: For Lab 10 you will turn in 2 .cpp files.
One should be named Lab10a and the other Lab10b.

Answer 1

Stack and Queues PART A Solution:

.// the code i am writing is a running code and giving correct output.so following is the bool same() functionality

bool flag=true; // valuse to be return
//create a queue
queue<T> myqueue;
//create a stack
stack<T> mystack;
//push into stack
for (auto &entry: TVector)
mystack.push(entry);
//push into queue
for (auto &entry: TVector)
myqueue.push(entry);
//compare the stack and queue "output" when you pop it
while (!myqueue.empty() && !mystack.empty())
{
T t1=mystack.top();
mystack.pop();

T t2=myqueue.front();
myqueue.pop();

if(t1!=t2)
{
flag=false;
}

}

return flag;
}

// It is exactly 15 line code,it is running and producing correct output.I can give the whole program as well if you //require.

PART B: TREES

int IntBinaryTree::countNodes(TreeNode *nodePtr)
{
if (nodePtr == NULL)

return 0;
//write only one line of code here
else

return (1+ countNodes(nodePtr->left) + countNodes(nodePtr->right) );
//write only one line of code here
}

IDE output for PART A

stdout copy iVector1 values are in the same order forwards and backwards iVector2 values are NOT in the same order forwards and backwards sVector1 values are in the same order forwards and backwards sVector2 values are NOT in the same order forwards and backwards

Whole Program:-

#include <iostream>
#include <queue>
#include <stack>





using namespace std;

template < typename T>

bool Same(vector<T> TVector);


int main()

{


const int SIZE_INT = 8;

const int SIZE_STRING = 6;

int iTemp1[]= {1,1,2,3,3,2,1,1};

int iTemp2[]= {1,1,2,3,2,3,1,1};

vector<int> iVector1(iTemp1, iTemp1 + SIZE_INT);

vector<int> iVector2(iTemp2, iTemp2+ SIZE_INT);

string sTemp1[]= {"aa", "bb", "cc", "cc", "bb", "aa"};

string sTemp2[]= {"aa", "bb", "cc", "bb", "cc", "aa"};

vector<string> sVector1(sTemp1, sTemp1 + SIZE_STRING);

vector<string> sVector2(sTemp2, sTemp2 + SIZE_STRING);

if (Same(iVector1))

cout << "iVector1 values are in the same order forwards and backwards\n";

else

cout << "iVector1 values are NOT in the same order forwards and backwards\n";

if (Same(iVector2))

cout << "iVector2 values are in the same order forwards and backwards\n";

else

cout << "iVector2 values are NOT in the same order forwards and backwards\n";

if (Same(sVector1))

cout << "sVector1 values are in the same order forwards and backwards\n";

else

cout << "sVector1 values are NOT in the same order forwards and backwards\n";

if (Same(sVector2))

cout << "sVector2 values are in the same order forwards and backwards\n";

else

cout << "sVector2 values are NOT in the same order forwards and backwards\n";

system("pause");

return 0;

}

template <typename T>

bool Same(vector<T> TVector)

{

/* Write the code for this function. You must use one STL stack of

* type T and one STL queue of type T. You should not have more than 15 lines of

* code total.

*/

//steps:
bool flag=true;
//create a queue
queue<T> myqueue;
//create a stack
stack<T> mystack;
//push into stack
for (auto &entry: TVector)
mystack.push(entry);
//push into queue
for (auto &entry: TVector)
myqueue.push(entry);
//compare the stack and queue "output" when you pop it
while (!myqueue.empty() && !mystack.empty())
{
T t1=mystack.top();
mystack.pop();

T t2=myqueue.front();
myqueue.pop();

if(t1!=t2)
{
flag=false;
}

}

return flag;
}