FREE Trial
Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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

image text in transcribed

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

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Design Using Entity Relationship Diagrams

Database Design Using Entity Relationship Diagrams

Authors: Sikha Saha Bagui, Richard Walsh Earp

3rd Edition

103201718X, 978-1032017181

More Books

Students also viewed these Databases questions

Question

★★★★★
Joseph Max, Inc., sold 10-year, 7 percent bonds for $1,000,000 at 98. On the interest payment date at the end of the 5th year the bonds were outstanding, 50 percent of the bonds were retired by Max...

Answered: 1 week ago

Question

★★★★★
write PHP code of (DB select insert update delete )

Answered: 1 week ago

Question

★★★★★
7.76 Imagery and Memory A research psycholo- gist is planning an experiment to determine whether the use of imagery picturing a word in your mind- affects people's ability to memorize. He wants to...

Answered: 1 week ago

Question

★★★★★
Use discriminant analysis to classify the new data in the Excel file Credit Approval Decisions Coded using only credit score and years of credit history as input variables.

Answered: 1 week ago

Question

★★★★★
I need an exams merged brief explanation/ steps of data normalization 1NF, 2NF, 3NF.

Answered: 1 week ago

Question

★★★★★
5. Sugar Supply (in kg) from 50 merchants in city 'X' on December 31st Sugar Supply XI Fr 90 - 99 94.5 2 100 - 109 104,5 20 110-119 114,5 13 120 - 129 124,5 7 130 - 139 134.5 6 140-149 144,5 2 amount...

Answered: 1 week ago

Question

★★★★★
A restaurant manager who arranges to have all of the restaurants leftovers, plus 50 prepared meals, donated to a food bank each week probably exhibited ________ power to coordinate the extra work...

Answered: 1 week ago

Question

★★★★★
How would you express "Juan needs to take an Economics class" in Spanish? Juan tiene tomar una clase de economa. Juan tener estudia una clase de economa. Juan tiene que tomar una clase de economa....

Answered: 1 week ago

Question

★★★★★
Balance sheet 1: 1. If Total Assets are $3,600 and Total Equity is $2,800 then what is the value of Total Liabilities? 2. Fill in the missing information from the balance sheet. Gulf Shipping Company...

Answered: 1 week ago

Question

★★★★★
The Texas Bill of Rights, Section 24 states that the "Military shall _______ to the civil authority." Question 99 options: at all times be subordinate. at times of peace be subordinate. at no time be

Answered: 1 week ago

Question

★★★★★
Question 5 of 21. A significant downfall of the Milestone chart is that it does not effectively portray the relationships, dependencies, and constraints among the project activities and events. Which...

Answered: 1 week ago

Question

★★★★★
What are negative messages? (Objective 1)

Answered: 1 week ago

Question

★★★★★
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...

Answered: 1 week ago

Question

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

Answered: 1 week ago

Previous Question Next Question