Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Want to write Tests for these methods in java. package towerOfHanoi; import java.util.EmptyStackException; import stack.StackInterface; public class LinkedStack implements StackInterface { private Node topNode; private

Want to write Tests for these methods in java.

package towerOfHanoi;

import java.util.EmptyStackException;

import stack.StackInterface;

public class LinkedStack implements StackInterface {

private Node topNode;

private int size;

public LinkedStack() {

topNode = null;

size = 0;

}

/**

* this method returns the size

*

*/

public int size() {

return size;

}

/**

* this method clears the stack

*/

@Override

public void clear() {

topNode = null;

size = 0;

}

@Override

public boolean isEmpty() {

if (size == 0) {

return true;

}

return false;

}

@Override

public T peek() {

if (this.isEmpty()) {

throw new EmptyStackException();

}

return topNode.getData();

}

@Override

public T pop() {

if (this.isEmpty()) {

throw new EmptyStackException();

}

T removed = topNode.getData();

topNode = topNode.getNextNode();

size--;

return removed;

}

@Override

public void push(T anEntry) {

Node node = new Node(anEntry, topNode);

topNode = node;

size++;

}

/**

*

*/

@SuppressWarnings("hiding")

private class Node {

@SuppressWarnings("unused")

private Node next;

private T data;

/**

*

* @param dataPortion

* @param next

*/

private Node(T dataPortion, Node nextNode) {

data = dataPortion;

next = nextNode;

}

/**

*

* this is the getter method for nextNode

*/

@SuppressWarnings("unused")

public Node getNextNode() {

return this.getNextNode();

}

/**

* this returns the data for the node

*

*/

public T getData() {

return data;

}

/**

* this is the setter method for the next node

*

*/

@SuppressWarnings("unused")

public void setNextNode(Node nextNode) {

next = nextNode;

}

}

@Override

public String toString() {

StringBuilder s = new StringBuilder();

s.append("[");

Node tp = topNode;

while (tp != null) {

if (s.length() > 1) {

s.append(", ");

}

s.append(tp.getData());

tp = tp.getNextNode();

}

s.append("]");

return s.toString();

}

}

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

Advances In Databases And Information Systems 25th European Conference Adbis 2021 Tartu Estonia August 24 26 2021 Proceedings Lncs 12843

Authors: Ladjel Bellatreche ,Marlon Dumas ,Panagiotis Karras ,Raimundas Matulevicius

1st Edition

3030824713, 978-3030824716

More Books

Students also viewed these Databases questions