Skip to content

Commit ffbc68d

Browse files
authored
Merge branch 'master' into newbranch2
2 parents 6852766 + bca8d0e commit ffbc68d

File tree

2 files changed

+0
-23
lines changed

2 files changed

+0
-23
lines changed

src/main/java/com/thealgorithms/datastructures/stacks/NodeStack.java

Lines changed: 0 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -95,15 +95,4 @@ public boolean isEmpty() {
9595
public int size() {
9696
return size;
9797
}
98-
99-
/**
100-
* Prints the contents of the stack from top to bottom.
101-
*/
102-
public void print() {
103-
Node current = head;
104-
while (current != null) {
105-
System.out.println(current.data);
106-
current = current.previous;
107-
}
108-
}
10998
}

src/test/java/com/thealgorithms/datastructures/stacks/NodeStackTest.java

Lines changed: 0 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -70,16 +70,4 @@ void testSize() {
7070
stack.pop();
7171
assertEquals(0, stack.size(), "Size should be 0 after popping all elements.");
7272
}
73-
74-
@Test
75-
void testPrint() {
76-
NodeStack<Integer> stack = new NodeStack<>();
77-
stack.push(1);
78-
stack.push(2);
79-
stack.push(3);
80-
81-
// Output verification would ideally be handled through a different means
82-
// but you can print as a basic check to confirm method runs without errors.
83-
stack.print();
84-
}
8573
}

0 commit comments

Comments
 (0)