Program Explanation Program: //import statement import java.util.Collection; //class Test public class Test { //main method public static void main(String[] args) { //allocation of memory new Test(); } //create an object private BST<Integer> tree = new BST<>(); //definition of "Test" method public Test() { //insert the element into the tree tree.insert(50); tree.insert(25); tree.insert(75); tree.insert(12); tree.insert(30); tree.insert(70); tree.insert(80); tree.insert(110); tree.insert(10); //call the "inorder" method tree.inorder(); //display the new line System.out.println(); //call the "preorder" method tree.preorder(); //display the new line System.out.println(); //call the "postorder" method tree.postorder(); //display the new line System.out.println(); //call the "delete" method tree.delete(75); //call the "inorder" method tree.inorder(); //display the new line System.out.println(); //call the "preorder" method tree.preorder(); //display the new line System.out.println(); //call the "postorder" method tree.postorder(); //display the new line System.out.println(); //call the "delete" method tree.delete(50); //call the "inorder" method tree.inorder(); //display the new line System.out.println(); //call the "preorder" method tree.preorder(); //display the new line System.out.println(); //call the "postorder" method tree.postorder(); //display the new line System.out.println(); } //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...

Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)

11th Edition

ISBN: 9780134671710

Author: Y. Daniel Liang

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 25, Problem 25.12PE

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 25, Problem 25.11PE

Chapter 25, Problem 25.14PE

Students have asked these similar questions

1. Level the resources (R) for the following network. Show exactly which activity is being moved at each cycle and how many days it is being moved. Show all cycles required to utilize the free float and the back float. B H 3 3 L 2 0-0-0 A C F G K N P Q T 0 3 2 2 1 2-2-2 7R 8R 4R 6R 4R 2R 5R 4R D 1 2R 2 M 000 4R 2 4R 1 2 3 4 B5 B BE B 5 5 7 D 2003 C NO C MBSCM В H 5 2 F 7 7 8 SH2F80 5 Н Н 6 7 7L3G4+ 6H2G4 J 4 4 14 8 L K 00 36 9 10 11 12 13 14 15 P 2 Z+ N N 4 4 Z t 2334 4 Σ + M M 4 +

2. Perform resource allocation for the following project. Resource limits are 6 labors and 2 helpers. Legend: Activity Dur Resources G H 2 3 2L 1H 2L OH A 1 3L 1H + B D F J K 3 4 6 2 4 4L 2H 3L OH 4L 1H 2L 2H 4L 2H C E 2 2 I 1 2L 1H 3L 1H 5L 1H

Need Java method please. Thank you.

Chapter 25 Solutions

Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)

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

Find the velocity if the capacitors were charged to 100,000 volts.

Thinking Like an Engineer: An Active Learning Approach (4th Edition)

Differences between method overloading and overriding Method overloading Method overriding Methods have the sam...

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

Dynamic scoping means that the scope of a variable is dynamic. That is, it refers to change. The call stack can...

Concepts Of Programming Languages

A piece of data which is sent to the module is called as “arguments”. Hence, the correct answer is option “A”.

Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)

The resultant force and the line of action intersects the beam measured from O.

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

(a) Entity integrity is enforced in SQL CREATE TABLE command.

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.