Introduction to Java Programming 10th ed **25.4 ( Implement preorder traversal without using recursion ) Implement the preorder 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 preorder method to display the elements. Solution package info.codeaddict.blog.tree.binary; import java.util.LinkedList; import java.util.Queue; /** * @author codeaddict.info */ public class PreOrderWithoutRecursion implements Traversal { @Override public void traverse(BinaryTree.Node root) { Queue queue = new LinkedList<>(); pushAllLeft(queue, root); while (!queue.isEmpty()) { BinaryTree.Node node = queue.poll(); System.out.println(node.value()); pushAllLeft(queue, node.right()); } } private void pushAllLeft(Queue queue, BinaryTree.Node node) { while (node != null) { queue.add(node); node = node.left(); } } } .