Moved StackPostfixNotation.java from the Others section to the Stack section

src/main/java/com/thealgorithms/datastructures/stacks/BalancedBrackets.java → src/main/java/com/thealgorithms/stacks/BalancedBrackets.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.Stack;
 

src/main/java/com/thealgorithms/datastructures/stacks/CalculateMaxOfMin.java → src/main/java/com/thealgorithms/stacks/CalculateMaxOfMin.java

@@ -7,7 +7,7 @@
  * Program description - Given an integer array. The task is to find the maximum of the minimum of
  * the array
  */
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.*;
 

src/main/java/com/thealgorithms/datastructures/stacks/DecimalToAnyUsingStack.java → src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.Stack;
 

src/main/java/com/thealgorithms/datastructures/stacks/DuplicateBrackets.java → src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 //  1. You are given a string exp representing an expression.
 // 2. Assume that the expression is balanced  i.e. the opening and closing brackets match with each

src/main/java/com/thealgorithms/datastructures/stacks/InfixToPostfix.java → src/main/java/com/thealgorithms/stacks/InfixToPostfix.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.Stack;
 

src/main/java/com/thealgorithms/datastructures/stacks/LargestRectangle.java → src/main/java/com/thealgorithms/stacks/LargestRectangle.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.Stack;
 

src/main/java/com/thealgorithms/datastructures/stacks/MaximumMinimumWindow.java → src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.Arrays;
 import java.util.Stack;

src/main/java/com/thealgorithms/datastructures/stacks/NextGraterElement.java → src/main/java/com/thealgorithms/stacks/NextGraterElement.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.Arrays;
 import java.util.Stack;

src/main/java/com/thealgorithms/datastructures/stacks/NextSmallerElement.java → src/main/java/com/thealgorithms/stacks/NextSmallerElement.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.Arrays;
 import java.util.Stack;

src/main/java/com/thealgorithms/datastructures/stacks/PostfixToInfix.java → src/main/java/com/thealgorithms/stacks/PostfixToInfix.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.datastructures.stacks;
+package com.thealgorithms.stacks;
 
 import java.util.Stack;
 

src/main/java/com/thealgorithms/others/StackPostfixNotation.java → src/main/java/com/thealgorithms/stacks/StackPostfixNotation.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.stacks;
 
 import java.util.Scanner;
 import java.util.Stack;

src/test/java/com/thealgorithms/others/CalculateMaxOfMinTest.java → src/test/java/com/thealgorithms/stacks/CalculateMaxOfMinTest.java

@@ -1,8 +1,7 @@
-package com.thealgorithms.others;
+package com.thealgorithms.stacks;
 
 import static org.junit.jupiter.api.Assertions.*;
 
-import com.thealgorithms.datastructures.stacks.CalculateMaxOfMin;
 import org.junit.jupiter.api.Test;
 
 public class CalculateMaxOfMinTest {
@@ -11,48 +10,48 @@ public class CalculateMaxOfMinTest {
     void testForOneElement() {
         int[] a = {10, 20, 30, 50, 10, 70, 30};
         int k = CalculateMaxOfMin.calculateMaxOfMin(a);
-        assertTrue(k == 70);
+        assertEquals(70, k);
     }
 
     @Test
     void testForTwoElements() {
         int[] a = {5, 3, 2, 6, 3, 2, 6};
         int k = CalculateMaxOfMin.calculateMaxOfMin(a);
-        assertTrue(k == 6);
+        assertEquals(6, k);
     }
 
     @Test
     void testForThreeElements() {
         int[] a = {10, 10, 10, 10, 10, 10, 10};
         int k = CalculateMaxOfMin.calculateMaxOfMin(a);
-        assertTrue(k == 10);
+        assertEquals(10, k);
     }
 
     @Test
     void testForFourElements() {
         int[] a = {70, 60, 50, 40, 30, 20};
         int k = CalculateMaxOfMin.calculateMaxOfMin(a);
-        assertTrue(k == 70);
+        assertEquals(70, k);
     }
 
     @Test
     void testForFiveElements() {
         int[] a = {50};
         int k = CalculateMaxOfMin.calculateMaxOfMin(a);
-        assertTrue(k == 50);
+        assertEquals(50, k);
     }
 
     @Test
     void testForSixElements() {
         int[] a = {1, 4, 7, 9, 2, 4, 6};
         int k = CalculateMaxOfMin.calculateMaxOfMin(a);
-        assertTrue(k == 9);
+        assertEquals(9, k);
     }
 
     @Test
     void testForSevenElements() {
         int[] a = {-1, -5, -7, -9, -12, -14};
         int k = CalculateMaxOfMin.calculateMaxOfMin(a);
-        assertTrue(k == -1);
+        assertEquals(-1, k);
     }
 }

src/test/java/com/thealgorithms/others/StackPostfixNotationTest.java → src/test/java/com/thealgorithms/stacks/StackPostfixNotationTest.java

@@ -1,8 +1,7 @@
-package com.thealgorithms.others;
+package com.thealgorithms.stacks;
 
 import static java.util.Map.entry;
-import static org.junit.jupiter.api.Assertions.assertEquals;
-import static org.junit.jupiter.api.Assertions.assertThrows;
+import static org.junit.jupiter.api.Assertions.*;
 
 import java.util.Map;
 import org.junit.jupiter.api.Test;