// Helene Martin, CSE 143
// Demonstrates basic stack and queue usage.
import java.util.*;

public class StackQueueDemo {
   public static void main(String[] args) {
      Stack<String> tas = new Stack<String>();
      tas.push("Madison"); // bottom
      tas.push("Baback");
      tas.push("Tristan"); // top
      System.out.println(tas);

      // stack traversal
      while (!tas.isEmpty()) {
         System.out.println(tas.pop());
      }
      System.out.println(tas); // contents destroyed

      Queue<String> tas2 = new LinkedList<String>();
      tas2.add("Madison"); // front
      tas2.add("Baback");
      tas2.add("Tristan"); // back
      System.out.println(tas2);

      // queue traversal
      int size = tas2.size();
      for (int i = 0; i < size; i++) {
         System.out.println(tas2.remove());
      }
      System.out.println(tas2); // contents destroyed
   }
}