Program Explanation Program: //import statement import java.util.Scanner; import java.util.Collection; //class Test public class Test { // main method public static void main(String[] args) { //create the objects Scanner input = new Scanner(System.in); BST<Integer> tree = new BST<>(); /* prompt the user to enter 10 integers and store them in the tree*/ for (int i = 0; i < 10; i++) { tree.insert(input.nextInt()); } //call the "inorder" method tree.inorder(); //create an object BST<String> tree1 = new BST<>(); //insert the value to the tree tree1.insert("George"); tree1.insert("Michael"); tree1.insert("Tom"); tree1.insert("Adam"); tree1.insert("Jones"); tree1.insert("Peter"); tree1.insert("John"); tree1.insert("Daniel"); //call the method tree1.nonRecursiveInorder(); } //definition of "BST" class public static class BST<E extends Comparable<E>> implements Tree<E> { //declare the variables protected TreeNode<E> root; protected int size = 0; //create a default binary tree public BST() { } //create a binary tree from an array of objects public BST(E[] objects) { //check the condition for (int i = 0; i < objects.length; i++) //insert the values insert(objects[i]); } //definition of "search" method public boolean search(E e) { //start from the root TreeNode<E> current = root; //check the condition while (current != null) { //check the condition if (e.compareTo(current.element) < 0) { //set the value current = current.left; } //check the condition else if (e.compareTo(current.element) > 0) { //set the value current = current.right; } //otherwise else //return statement return true; } //return statement return false; } //definition of "insert" method public boolean insert(E e) { //check the condition if (root == null) //create a new root root = createNewNode(e); //otherwise else { // locate the parent node TreeNode<E> parent = null; TreeNode<E> current = root; //check the condition while (current != null) //check the condition if (e.compareTo(current.element) < 0) { //set the value parent = current; current = current.left; } //check the condition else if (e.compareTo(current.element) > 0) { //set the value parent = current; current = current.right; } //otherwise else //return statement return false; //check the condition if (e.compareTo(parent.element) < 0) //create a new node parent.left = createNewNode(e); else //create a new node parent.right = createNewNode(e); } //increment the size size++; //return statement return true; } //definition of "createNewNode" protected TreeNode<E> createNewNode(E e) { //return the statement return new TreeNode<E>(e); } //definition of "inorder" public void inorder() { //inorder traverse from the root inorder(root); } //definition of inorder protected void inorder(TreeNode<E> root) { //check the condition if (root == null) //return statement return; // inorder traversal from a subtree inorder(root.left); //display the element System.out.print(root.element + " "); // inorder traversal from a subtree inorder(root.right); } // definition of "postoder" public void postorder() { // postorder traversal from the root postorder(root); } // definition of "postorder" protected void postorder(TreeNode<E> root) { //check the condition if (root == null) //return statement return; //postorder traversal from a subtree postorder(root.left); postorder(root.right); //display the element System.out.print(root.element + " "); } //definition of "preorder" public void preorder() { // preorder traversal from the root preorder(root); } //definition of "preorder" protected void preorder(TreeNode<E> root) { //check the condition if (root == null) //return statement return; //display the value System.out.print(root.element + " "); // preorder traversal from a subtree preorder(root.left); preorder(root.right); } //definition of "TreeNode" class public class TreeNode<E extends Comparable<E>> { //declare the variables E element; TreeNode<E> left; TreeNode<E> right; //definition of constructor public TreeNode(E e) { //set the value element = e; } } // definition of "getSize" method public int getSize() { //return statement return size; } // definition of "getRoot" method public TreeNode getRoot() { //return statement return root; } // definition of method public java.util.ArrayList<TreeNode<E>> path(E e) { //create an object java.util.ArrayList<TreeNode<E>> list = new java.util.ArrayList<TreeNode<E>>(); // start from the root TreeNode<E> current = root; //check the condition while (current != null) { //add the node to the list list.add(current); //check the condition if (e.compareTo(current.element) < 0) { //set the value current = current.left; } //check the condition else if(e.compareTo(current.element) > 0) { //set the value current = current.right; } else //break statement break; } //return statement return list; } //definition of "delete" method public boolean delete(E e) { // declare the variables TreeNode<E> parent = null; TreeNode<E> current = root; //check the condition while (current != null) { //check the condition if (e.compareTo(current.element) < 0) { //set the value parent = current; current = current.left; } //check the condition else if (e.compareTo(current.element) > 0) { //set the value parent = current; current = current...

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package

11th Edition

ISBN: 9780134694511

Author: Liang, Y. Daniel

Publisher: Pearson Education Canada

See similar textbooks

Concept explainers

Array

The simplest way to start thinking about an array is as a collection, or a set of elements. In programming, these elements may be constants, variables, functions and pointers.

Videos

Question

Chapter 25, Problem 25.3PE

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 25, Problem 25.1PE

Chapter 25, Problem 25.4PE

Students have asked these similar questions

Need help writing code to answer this question in Python! (image attached)

Need help with python code! How do I simplify my code for a beginner to understand, simple fixed format and centering? Such as: print(f"As an int variable: {age_int:^7}") print(f"In numeric binary: {age_int:^7b}") My Code:name = input("Enter your name: ")print(f"In text name is: {' '.join(name)}")decimal_values = []binary_values = []for letter in name: ascii_val = ord(letter) binary_val = format(ascii_val, '08b') decimal_values.append(str(ascii_val)) binary_values.append(binary_val)# Loop through each letter:print(f"In ASCII decimal: {' '.join(decimal_values)}")print(f"In ASCII binary: {' '.join(binary_values)}")# Ageage_str = input("Enter your age: ")age_int = int(age_str)print(f"As a string \"{age_str}\": {' '.join(age_str)}")age_decimal_values = []age_binary_values = []for digit in age_str: ascii_val = ord(digit) binary_val = format(ascii_val, '07b') age_decimal_values.append(str(ascii_val)) age_binary_values.append(binary_val)print(f"In ASCII decimal: {'…

Don't use chatgpt or any other AI

Chapter 25 Solutions

Introduction to Java Programming and Data Structures, Comprehensive Version Plus MyProgrammingLab with Pearson EText -- Access Card Package

Chapter 25.2, Problem 25.2.1CP Chapter 25.2, Problem 25.2.2CP Chapter 25.2, Problem 25.2.3CP Chapter 25.2, Problem 25.2.4CP Chapter 25.2, Problem 25.2.5CP Chapter 25.3, Problem 25.3.1CP Chapter 25.3, Problem 25.3.2CP Chapter 25.3, Problem 25.3.3CP Chapter 25.3, Problem 25.3.4CP Chapter 25.4, Problem 25.4.1CP

Additional Engineering Textbook Solutions

Find more solutions based on key concepts

The Equations of the elastic curve for the beam using the x1 and x2 coordinates, the slope at A, and the maximu...

Mechanics of Materials (10th Edition)

The reactions at D.

INTERNATIONAL EDITION---Engineering Mechanics: Statics, 14th edition (SI unit)

The given code segment is developed into a complete program and given below: // Class definition class CheckPoi...

Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)

//declare the "counter" variable and set the value int counter = 2; //Line 1 //"do-while" condition do {//Line ...

Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)

In the programming structure, a loop that executes the sequence of instruction as long as the condition is not ...

Computer Science: An Overview (13th Edition) (What's New in Computer Science)

Methods adopted by primary keys to eliminate key ripple effects as database evolves.

Modern Database Management

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.