Intro to Java Programming 10th ed- Implement the inorder, preorder , postorder method in BST using a stack. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the inorder method, preorder method, postorder method to display the elements. inorder method to display the elements. Solution import static org.junit.Assert.assertEquals; import java.util.LinkedList; import java.util.Queue; import java.util.Stack; import org.junit.Test; public class BST { public TreeNode root = null; public TreeNode get(int element){ if(root == null){ return null; } TreeNode runner = root; while (true){ if(runner.data > element){ if(runner.leftNode == null){ return null; } runner = runner.leftNode; } else if(runner.data < element) { if(runner.rightNode == null){ return null; } runner = runner.rightNode; } else { return runner; } } } public void insert(int element){ if(root == null){ root = new TreeNode(element); return; } TreeNode runner = root; while (runner.data != element){ if(runner.data > element){ if(runner.leftNode == null){ runner.leftNode = new TreeNode(element); return; } runner = runner.leftNode; } else { if(runner.rightNode == null){ runner.rightNode = new TreeNode(element); return; } runner = runner.rightNode; } } } public static void postOrderTraversal(TreeNode root){ if(root == null){ return; } postOrderTraversal(root.leftNode); postOrderTraversal(root.rightNode); System.out.print(root.data + \" \"); } public static void preOrderTraversal(TreeNode root){ if(root == null){ return; } System.out.print(root.data + \" \"); preOrderTraversal(root.leftNode); preOrderTraversal(root.rightNode); } public static void inOrderTraversal(TreeNode root){ if(root == null){ return ; } inOrderTraversal(root.leftNode); System.out.print(root.data + \" \"); inOrderTraversal(root.rightNode); } private class TreeNode { public int data; public TreeNode leftNode; public TreeNode rightNode; public boolean visited; TreeNode(int data){ this.data = data; } } public void basicTest(){ BST tree = new BST(); int[] data = {9, 5, 3, 1, 4, 8, 15, 11, 21, 20, 29}; for (int i : data){ tree.insert(i); } assertEquals(tree.get(3).data, 3); } } .

1. Intro to Java Programming 10th ed-
Implement the inorder, preorder , postorder method in BST using a stack. Write a test
program that
prompts the user to enter 10 integers, stores them in a BST, and invokes the inorder method,
preorder method, postorder method to display the elements.
inorder method to display the elements.
Solution
import static org.junit.Assert.assertEquals;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;
import org.junit.Test;
public class BST {
public TreeNode root = null;
public TreeNode get(int element){
if(root == null){
return null;
}
TreeNode runner = root;
while (true){
if(runner.data > element){
if(runner.leftNode == null){
return null;
}
runner = runner.leftNode;
} else if(runner.data < element) {
if(runner.rightNode == null){
return null;
}

2. runner = runner.rightNode;
} else {
return runner;
}
}
}
public void insert(int element){
if(root == null){
root = new TreeNode(element);
return;
}
TreeNode runner = root;
while (runner.data != element){
if(runner.data > element){
if(runner.leftNode == null){
runner.leftNode = new TreeNode(element);
return;
}
runner = runner.leftNode;
} else {
if(runner.rightNode == null){
runner.rightNode = new TreeNode(element);
return;
}
runner = runner.rightNode;
}
}
}
public static void postOrderTraversal(TreeNode root){
if(root == null){
return;
}
postOrderTraversal(root.leftNode);
postOrderTraversal(root.rightNode);
System.out.print(root.data + " ");
}
public static void preOrderTraversal(TreeNode root){
if(root == null){
return;
}
System.out.print(root.data + " ");

3. preOrderTraversal(root.leftNode);
preOrderTraversal(root.rightNode);
}
public static void inOrderTraversal(TreeNode root){
if(root == null){
return ;
}
inOrderTraversal(root.leftNode);
System.out.print(root.data + " ");
inOrderTraversal(root.rightNode);
}
private class TreeNode {
public int data;
public TreeNode leftNode;
public TreeNode rightNode;
public boolean visited;
TreeNode(int data){
this.data = data;
}
}
public void basicTest(){
BST tree = new BST();
int[] data = {9, 5, 3, 1, 4, 8, 15, 11, 21, 20, 29};
for (int i : data){
tree.insert(i);
}
assertEquals(tree.get(3).data, 3);
}
}