/*
  Implement the postorder method in BST using a stack instead of recursion.
  Write a test program that prompts the user to enter 10 integers, stores them
  in a BST, and invokes the postorder method to display the elements.
*/

public class E25_05 {
  public static void main(String[] args) {
    String[] list = {"George", "Ben", "Mark", "Adam", "Carl", "Mack", "Nick"};
    BST<String> tree = new BST<>(list);

    tree.postorder();
    System.out.println();
  }
}

@@ -225,16 +225,43 @@
 ts.%0A*/%0A%0A
+import java.util.Scanner;%0A%0A
 public c
@@ -326,96 +326,229 @@
    S
-tring%5B%5D list = %7B%22George%22, %22Ben%22, %22Mark%22, %22Adam%22, %22Carl%22, %22Mack%22, %22Nick%22%7D;%0A    BST%3CString
+canner input = new Scanner(System.in);%0A    System.out.print(%22Enter 10 integers: %22);%0A    Integer%5B%5D list = new Integer%5B10%5D;%0A    for (int i = 0; i %3C list.length; i++) %7B%0A      list%5Bi%5D = input.nextInt();%0A    %7D%0A%0A    BST%3CInteger
 %3E tr

Add user input functionality