please help in c++ class stackLLprivate:class node{public://put what you need in here} ;node * top;public:stackLL (){}//Take care of memory leaks...-stackLL(){}//return true if empty, false if notbool empty ({}// add item to top of stackvoid push (int x){}!/remove and return top item from stackint pop(){}//add item x to stack, but insert it//right after the current ith item from thetop// (and before the i+l item).void insertAt(int x, int i){}};

Below i have implemented all the meathods:

class stackLL private: class node public: //put what you need in here } ; node * top; public: stackLL() {} //Take care of memory leaks... --stackLL() {} //return true if empty, false if not bool empty()

class stackLL private: class node public: //put what you need in here } ; node * top; public: stackLL() {} //Take care of memory leaks... --stackLL() {} //return true if empty, false if not bool empty()

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

Code in java please import java.util.*;public class QueueLastname //<------ change the name of the class to include yourlast name{// no code goes here}class Queue{private ArrayList<String> q;public Queue( ){q = new ArrayList<String>();}public void enqueue(String num){q.add(num);}public String dequeue(){return q.remove(0);}/*This method goes through the quque and finds the longest name in the qThe queue must be restored in its original state after finding the longestname*/public String getLongestName(){Stack s = new Stack();String longest = q.get(0);// q.remove(0);boolean b = false;while(!b){try{String front = q.get(0);//get the first elementq.remove(0);//remove it from the qs.push(front);// push it to the stackif (front.length() > longest.length() )longest = front;}catch(Exception e){b = true;}}restore(s); // restoring the queuereturn longest; }/*Traverse through the queue and creates a string containing all the names.must restore the quque to its original…
java: Implement the class Node public class Node { private char data; private Node nextNode; //implements default constructor //implements parameterize constructor take integer as input in parameter a assign that integer to data and assign null to nextNode //implement setters and getters } Implement the class Stack having one member having type Node public class Stack { private Node top; public void push (); public Node pop (); public Boolean isEmpty(); return true if stack is empty // implements all its function and write time complexity of its function
in java starting with an empty stack mimic the functionality of the back and forward button on modern browsers that is, at any point that the stack is not empty,allow a back function to display to previous page.also if you viewing a back page allow a forward button to go to the forward pages stack =[] go to page 1 - display page 1 - stack [page 1] go to page 2 - display page 2 -stack [page1,page 2] go back- display 1 - stack[ page1] go forward - display2 - [page 1 ,page 2] go to page 5- display page 5 -stack[page1,[age2,page5]
A double-ended queue or deque (pronounced “deck”) is like a stack or a queue but supports adding and removing items at both ends. A deque stores a collection of items and supports the following API: public class Deque implements Iterable Deque() create an empty deque boolean isEmpty() is the deque empty? int size() number of items in the deque void pushLeft(Item item) add an item to the left end void pushRight(Item item) add an item to the right end Item popLeft() remove an item from the left end Item popRight() remove an item from the right end API for a generic double-ended queue Write a class Deque that uses a doubly-linked list to implement this API and a class ResizingArrayDeque that uses a resizing array
Create a class Stack. This stack will be implemented using the LinkedList class that has been provided. This stack will hold values of a generic type (<T>). Your Stack should have the following public methods: public void push(int n) public T pop() public T peek() public T size() public boolean isEmpty() public class LinkedList <T> { private Node head; private Node tail; private int size; public LinkedList() { head = null; tail = null; size = 0; } public void append(T data) { Node newNode = new Node(data); if (head == null) { head = newNode; } else { tail.next = newNode; } tail = newNode; size++; } public void prepend(T data) { Node newNode = new Node(data); if (head == null) { head = newNode; tail = newNode; } else { newNode.next = head; head = newNode; } size++; } public T getHead() { return head.data; } public T getTail() { return tail.data; } public int size() { return size; } public void removeByValue(T data) { Node current = head; while…
Lab 4: Building a stack with two queuesProblem. Using two queues implement a stack as a class calledQueueStack. Build the following methods:1. push that adds an item to the top of the stack;2. pop that removes an item from the top of the stackand returns the removed item;3. peek that returns the item at the top of the stack;4. isEmpty that checks if the stack is empty.Estimate runtime complexities of the methods that you built.Hint. Use two queues queueIn and queueOut. The first queue queueInserves for pushing new items. When popping an item, move all the itemsbut the last one from queueIn to queueOut.queueIn [1 2 3 4 5] −→queueIn [5]queueOut [ ] −→queueOut [1 2 3 4]Now the item to be popped is in queueIn. Remove and return that asthe item on top of the stack.queueIn [ ]queueOut [1 2 3 4]Now you should swap the queues, so this algorithm may be repeatednext time when one has to pop the stack.queueIn [1 2 3 4]queueOut [ ] (ready for moving items)1
Need help with python code. Write a LikedStack . Test it by: Add numbers from 7 to 22 in the stack. Print the length of the stack Check if the stack is empty Show the item on the top of the stack Remove the last item in the stack Add 45 to the stack Remove all items in the stack Check if the stack is empty """File: linkedstack.pyAuthor: Ken Lambert"""from node import Nodefrom abstractstack import AbstractStackclass LinkedStack(AbstractStack):"""A link-based stack implementation."""# Constructordef __init__(self, sourceCollection = None):"""Sets the initial state of self, which includes thecontents of sourceCollection, if it's present."""# Accessor methodsdef __iter__(self):"""Supports iteration over a view of self.Visits items from bottom to top of stack."""def visitNodes(node):"""Adds items to tempList from tail to head."""def peek(self):"""Returns the item at the top of the stack.Precondition: the stack is not empty.Raises: KeyError if the stack is empty."""if self.isEmpty():#…
Write a java GUI program stacking Student objects of a class. Your program should have buttons for push, pop, and peek. Create a student class with these fields: name (type: String), age (type : int), major ( type: String), gpa (type: double) and gender (type:char). Use Java Stack class for implementation and use the GUI for user interaction. At run time books stored in stack should follow the last in First out (LIFO) of a stack.
URGENT URGENT URGENT !!!! Write a void method swapStackwithQueue that takes MyStack and MyQueue Objects as parameters and exchanges the elements. a) The top element of the old stack becomes the rear element of the new queue. b b) and the rear element of the old queue becomes the top element of the new stack. The output should be similar to the image.
In Java, The following is a class definition of a linked list Node: class Node{int info;Node next;}Assume that head references a linked list and stores in order, the int values 5, 2 and 9. Show the instructions needed to move the value 2 in front of the value 5 so that the list is now 2, 5 and 9.
In java The following is a class definition of a linked list Node:class Node{int info;Node next;}Assume that head references a linked list and stores in order, the int values 5, 7 and 9. Show the instructions needed to delete the Node with 5 so that head would reference the list 7 and 9.
class Polynomial: class TermNode:def __init__(self, coefficient: int, exponent: int) -> None:"""Initialize this node to represent a polynomial term with thegiven coefficient and exponent. Raise ValueError if the coefficent is 0 or if the exponentis negative."""if coefficient == 0:raise ValueError("TermNode: zero coefficient")if exponent < 0:raise ValueError("TermNode: negative exponent") self.coeff = coefficientself.exp = exponentself.next = None def __init__(self, coefficient: int = None, exponent: int = 0) -> None:"""Initialize this Polynomial with a single term constructed from thecoefficient and exponent. If one argument is given, the term is a constant coefficient(the exponent is 0).If no arguments are given, the Polynomial has no terms. # Polynomial with no terms:>>> p = Polynomial()>>> print(p._head)None>>> print(p._tail)None # Polynomial with one term (a constant):>>> p = Polynomial(12)>>> p._head.coeff12>>>…