In this problem, we need to create a method capable of calculating the distance between the deepest node on the left to the deepest node on the right. However my code is struggling to even output my binary search tree, and I am not sure how to code the method. Can someone please explain how I could code this? /////////////////////////////////////////////////////////////////////////// // // Pro3105 // // Write a program that creates a binary search tree of 15 to 30 // random Capital Letters. // // Define the tree width operation by writing the method that will // calculate the distance from the deepest node of the left subtree // to the deepest node of the right subtree. // // K // ......../ \.......................... // / \ // H U // .../ \..... ......./ \... // / \ / \ // G K R V // / \ / / \.... / \ // / \ / / \ / \ // A H K R U V Y // / ........./ ../ \ // / / / \ // J M S Z // / \.... \ // / \ \ // L Q T // / \ // / \ // Q R // ./ // / // N // \ // \ // P // // eg. // width(); // // 13 // // // J // / \............ // / \ // I Q // .../ .../ \ // / / \ // D M R // / \ / \ \...... // / \ / \ \ // D F M Q X // / / / \ // / / / \ // C L U Z // / // / // T // eg. // width(); // // 10 // // /////////////////////////////////////////////////////////////////////////// package problem_set_31; import java.util.ArrayList; import static javax.swing.JOptionPane.showInputDialog; public class Pro3105 { public static void main(String[] args) { new Environment105().setVisible(true); } } class Environment105 extends View { BinaryTree105 letterTree = new BinaryTree105<>(); @Override public void buttonOneAction() { //************************************** // Randomly create an integer binary // search tree. //************************************** // Generate 16 random integer numbers between 10 and 50 int n = (int) (Math.random() * 16) + 15; for (int i = 0; i < n; i++) { char c = (char) (Math.random() * 26 + 'A'); letterTree.insert(c); } output.setText("Randomly created integer Binary Search Tree.\n"); output.append(new DisplayTree(letterTree.getRoot()).toString()); } @Override public void buttonTwoAction() { } @Override public void setParams() { buttonOne.setText("Create Tree"); buttonTwo.setText("Output Width"); } }

In this problem, we need to create a method capable of calculating the distance between the deepest node on the left to the deepest node on the right. However my code is struggling to even output my binary search tree, and I am not sure how to code the method. Can someone please explain how I could code this? /////////////////////////////////////////////////////////////////////////// // // Pro3105 // // Write a program that creates a binary search tree of 15 to 30 // random Capital Letters. // // Define the tree width operation by writing the method that will // calculate the distance from the deepest node of the left subtree // to the deepest node of the right subtree. // // K // ......../ \.......................... // / \ // H U // .../ \..... ......./ \... // / \ / \ // G K R V // / \ / / \.... / \ // / \ / / \ / \ // A H K R U V Y // / ........./ ../ \ // / / / \ // J M S Z // / \.... \ // / \ \ // L Q T // / \ // / \ // Q R // ./ // / // N // \ // \ // P // // eg. // width(); // // 13 // // // J // / \............ // / \ // I Q // .../ .../ \ // / / \ // D M R // / \ / \ \...... // / \ / \ \ // D F M Q X // / / / \ // / / / \ // C L U Z // / // / // T // eg. // width(); // // 10 // // /////////////////////////////////////////////////////////////////////////// package problem_set_31; import java.util.ArrayList; import static javax.swing.JOptionPane.showInputDialog; public class Pro3105 { public static void main(String[] args) { new Environment105().setVisible(true); } } class Environment105 extends View { BinaryTree105 letterTree = new BinaryTree105<>(); @Override public void buttonOneAction() { // // Randomly create an integer binary // search tree. // // Generate 16 random integer numbers between 10 and 50 int n = (int) (Math.random() * 16) + 15; for (int i = 0; i < n; i++) { char c = (char) (Math.random() * 26 + 'A'); letterTree.insert(c); } output.setText("Randomly created integer Binary Search Tree.\n"); output.append(new DisplayTree(letterTree.getRoot()).toString()); } @Override public void buttonTwoAction() { } @Override public void setParams() { buttonOne.setText("Create Tree"); buttonTwo.setText("Output Width"); } }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

// Pro3105

// Write a program that creates a binary search tree of 15 to 30

// random Capital Letters.

// Define the tree width operation by writing the method that will

// calculate the distance from the deepest node of the left subtree

// to the deepest node of the right subtree.

// K

// ......../ \..........................

// / \

// H U

// .../ \..... ......./ \...

// / \ / \

// G K R V

// / \ / / \.... / \

// / \ / / \ / \

// A H K R U V Y

// / ........./ ../ \

// / / / \

// J M S Z

// / \.... \

// / \ \

// L Q T

// / \

// Q R

// ./

// /

// N

// \

// P

// eg.

// width();

// 13

// J

// / \............

// / \

// I Q

// .../ .../ \

// / / \

// D M R

// / \ / \ \......

// / \ / \ \

// D F M Q X

// / / / \

// C L U Z

// /

// T

// eg.

// width();

// 10

///////////////////////////////////////////////////////////////////////////

package problem_set_31;

import java.util.ArrayList;

import static javax.swing.JOptionPane.showInputDialog;

public class Pro3105 {

public static void main(String[] args) {

new Environment105().setVisible(true);

}

class Environment105 extends View

{

BinaryTree105<Integer> letterTree = new BinaryTree105<>();

@Override

public void buttonOneAction()

{

//**************************************

// Randomly create an integer binary

// search tree.

//**************************************

// Generate 16 random integer numbers between 10 and 50

int n = (int) (Math.random() * 16) + 15;

for (int i = 0; i < n; i++) {

char c = (char) (Math.random() * 26 + 'A');

letterTree.insert(c);

}

output.setText("Randomly created integer Binary Search Tree.\n");

output.append(new DisplayTree<Integer>(letterTree.getRoot()).toString());

}

@Override

public void buttonTwoAction()

{

}

@Override

public void setParams()

{

buttonOne.setText("Create Tree");

buttonTwo.setText("Output Width");

}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

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.