Question: Stack.h: #ifndef NODEB_STACK_H #define NODEB_STACK_H /* * Stack class * Each Node point to the Node below it * Functionality: push, pop, peek, isEmpty, print

Stack.h: #ifndef NODEB_STACK_H #define NODEB_STACK_H /* * Stack class * Each

Stack.h:

#ifndef NODEB_STACK_H #define NODEB_STACK_H /*  * Stack class  * Each Node point to the Node below it  * Functionality: push, pop, peek, isEmpty, print  */  #include "Node.h" #include  using namespace std; templatetypename Object> class Stack { private: // Store the address of the top Node in the Stack  Node* top; public: // Constructor  Stack() { // Stack is empty. Top doesn't point at anything.  top = nullptr; } // Deconstructor / Destructor  ~Stack() { // Pop all the Nodes left in the Stack  while (!isEmpty()) { pop(); } } bool isEmpty() const { return (top == nullptr); } void push(Object item) { if (isEmpty()) { // This is the first Node in the Stack  // Allocate memory in the heap to store the new Node  Node* newNode = new Node(item); // Update top  top = newNode; } else { // There is already at least one Node in the Stack  Node* newNode = new Node(item, top); // Update top  top = newNode; } } Object pop() { if (isEmpty()) { // There is no Node to pop. Return the default Object.  // Note: This assumes the Object has a default constructor.  return Object(); } else { // There is at least one Node in the Stack.  // Store a copy of the Object to be returned  Object copy = top->getItem(); // Store a copy of top  Node* topCopy = top; // Update top to point at whatever the Node we are about to delete is pointing at  top = top->getNext(); // Delete the Node from heap memory  // Use the delete keyword with a pointer to the memory you want to deallocate from the heap  delete topCopy; // Return the Object  return copy; } } bool exists(Object item) const { Node* curr = top; while (curr != nullptr) { // Note: This assumes the Object can use the == operator  if (curr->getItem() == item) { // Found the item in the Stack  return true; } curr = curr->getNext(); } // Did not find the item in the Stack  return false; } void printStack() const { Node* curr = top; while (curr != nullptr) { // Note: This assumes that the Object can use the  cout getItem() getNext(); } } }; #endif //NODEB_STACK_H

Node.h:

#ifndef NODEB_STACK_H #define NODEB_STACK_H /*  * Stack class  * Each Node point to the Node below it  * Functionality: push, pop, peek, isEmpty, print  */  #include "Node.h" #include  using namespace std; templatetypename Object> class Stack { private: // Store the address of the top Node in the Stack  Node* top; public: // Constructor  Stack() { // Stack is empty. Top doesn't point at anything.  top = nullptr; } // Deconstructor / Destructor  ~Stack() { // Pop all the Nodes left in the Stack  while (!isEmpty()) { pop(); } } bool isEmpty() const { return (top == nullptr); } void push(Object item) { if (isEmpty()) { // This is the first Node in the Stack  // Allocate memory in the heap to store the new Node  Node* newNode = new Node(item); // Update top  top = newNode; } else { // There is already at least one Node in the Stack  Node* newNode = new Node(item, top); // Update top  top = newNode; } } Object pop() { if (isEmpty()) { // There is no Node to pop. Return the default Object.  // Note: This assumes the Object has a default constructor.  return Object(); } else { // There is at least one Node in the Stack.  // Store a copy of the Object to be returned  Object copy = top->getItem(); // Store a copy of top  Node* topCopy = top; // Update top to point at whatever the Node we are about to delete is pointing at  top = top->getNext(); // Delete the Node from heap memory  // Use the delete keyword with a pointer to the memory you want to deallocate from the heap  delete topCopy; // Return the Object  return copy; } } bool exists(Object item) const { Node* curr = top; while (curr != nullptr) { // Note: This assumes the Object can use the == operator  if (curr->getItem() == item) { // Found the item in the Stack  return true; } curr = curr->getNext(); } // Did not find the item in the Stack  return false; } void printStack() const { Node* curr = top; while (curr != nullptr) { // Note: This assumes that the Object can use the  cout getItem() getNext(); } } }; #endif //NODEB_STACK_H

Stack Class Start with the Stack class from lecture. What is the Big-Oh complexity of the methods? Queue Class Create a Queue class that uses the Node class from lecture to create a functioning queue data structure. . Your Queue should be able to push and pop Objects and determine if an Object is in the Queue. What is the complexity of each method? . Your Queue must be able to be used with any data type. Your Nodes must be stored in heap memory. . Your program must not have any memory leaks

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

C++ Program: Below are the instructions, followed by all necessary code/data. Stack.h: #ifndef NODEB_STACK_H #define NODEB_STACK_H #include "Node.h" #include using namespace std; template typename...

Q:

Below are the instructions, followed by all necessary code/data. Stack.h: #ifndef NODEB_STACK_H #define NODEB_STACK_H #include "Node.h" #include using namespace std; template typename Object> class...

Q:

Below are the instructions, followed by all necessary code/data. Stack.h: #ifndef NODEB_STACK_H #define NODEB_STACK_H #include "Node.h" #include using namespace std; template typename Object> class...

Q:

All the following code is below. Stack.h was pre-written. The Queue.h class (which uses the pre-written Node.h ) class was also written. Following those three classes is the code from "Project 1"...

Q:

All the following code is below. Stack.h, Node.h and Queue.h were pre-written, and the code after that is from "Project 1" (which is seen in the directions). Stack.h: #ifndef NODEB_STACK_H #define...

Q:

The Node and Stack classes are pre-written, and I've written the Queue class. Thus, all I need is the Main function. Stack.h: #ifndef NODEB_STACK_H #define NODEB_STACK_H #include "Node.h" #include...

Q:

The stack and node classes are below. Stack.h: #ifndef NODEB_STACK_H #define NODEB_STACK_H #include "Node.h" #include using namespace std; template typename Object> class Stack { private : Node *...

Q:

You will demonstrate your understanding of stacks in this exercise. Only 1 program is to be completed. All files require Javadoc documentation comments at the top to include a description of the...

Q:

This is question is about stack and queue, I finished stack and queue part. however, I don't know how to use the Command when I read something from the file. It should put wait into queue, and then...

Q:

NOTE: Below is the code for the Queue class (because it uses the Node class, I've also put the code for Node there). NOTE: The data type for project 1 is referring to a class I created called...

Q:

Bad-Debt Reporting from inception of operations to December 31, 2010, Fortner Corporation provided for uncollectible accounts receivable under the allowance method: provisions were made monthly at 2%...

Q:

Find all values of h such that y will be in the subspace of R spanned by Vij VZ, V3 if V2 %3D and Y = 3 3.

Q:

The Heating Division of Riverbed International produces a heating element that it sells to ics customers for $ 4 4 per unit. lis unit variable cost is $ 2 5 , and its unit fued cont is $ 1 2 . Top...

Q:

P-1) (100 Pts.) A chemical manufacturing company (CMC) has a contract for the procurement of the neccssaly chemicals from four suppliers. The chemicals purchased from Supplier A are priced at $20...

Q:

What are negative messages? (Objective 1)

Q:

Welcome. You are the president of the Tri-City Industrial Foundation.You have been successful in getting Little Toy Machines, a toy manufacturer, to relocate to your community. This factory will...

Q:

What are two important advantages of using the indirect plan for bad news messages? (Objectives 2 and 3)