Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
11th Edition
ISBN: 9780134671710
Author: Y. Daniel Liang
Publisher: PEARSON
Question
Book Icon
Chapter 18, Problem 18.39PE
Program Plan Intro

Drag the tree

Program Plan:

  • Import required packages.
  • Define the main class “E39” that extends the “Application” class.
    • The method “start ()” overrides the start method in the “Application” class.
      • Create a tree pane
      • Create a text field.
      • Set the depth.
      • Set the value of the property using “setPrefColumnCount (4)”.
      • Set the alignment to bottom right.
      • Create a HBox pane
      • Add the label and text field to the pane.
      • Set the hbox alignment to center.
      • Create a border pane
      • Set the pane to the center location.
      • Set the border pane at the bottom.
      • Create a scene and place it on the stage.
      • Display the stage using “show ()” method.
      • Set the width and height.
    • Declare a static class “TreePane” that extends Pane.
      • Declare required variables.
      • Give the constructor for this class.
        • Set the mouse handler
        • Call the function “paint ()”.
      • Function definition to set depth of the tree.
        • Set the depth and call the function “paint()”.
      • Give function definition for “paint ()”.
        • Clear the pane.
        • Check the condition “(startX == 0 && startY == 0)”.
          • Update the values.
        • Paint the branch by calling the function “paint_Branch ()”.
      • Give function definition for “paint_Branch ()”.
        • Check if the depth is greater than 0.
          • Calculate, create and add the line to the pane.
          • Draw the left branch of the tree.
          • Draw the right branch of the tree.
    • Declare a “main ()” function.
      • Launch the application.

Blurred answer
Students have asked these similar questions
(Intro to Java) explain the answers to the below questions using step-by-step explanation.
(Geometry: polygon subareas) A convex 4-vertex polygon is divided into four triangles, as shown in Figure 8.8. V2 (x2, y2) V1 (x1, y1) V3 (x3, y3) V4 (x4, y4) A 4-vertex polygon is defined by four vertices. Write a program that prompts the user to enter the coordinates of the four ver- tices and displays the areas of the four triangles in increasing order. Here is a sample run:
(Convert decimals to fractions)Write a program that prompts the user to enter a decimal number and displays the number in a fraction.Hint: read the decimal number as a string, extract the integer part and fractional part from the string, and use the Rational class in LiveExample 13.13 to obtain a rational number for the decimal number. Use the template athttps://liveexample.pearsoncmg.com/test/Exercise13_19.txt The problem can not use BigInteger //Below is the Rational LiveExample 13.13 that goes with the problem/question; notice "long" instead of "BigInteger" class Rational extends Number implements Comparable<Rational> {  // Data fields for numerator and denominator  private long numerator = 0;  private long denominator = 1;   /** Construct a rational with default properties */  public Rational() {    this(0, 1);  }   /** Construct a rational with specified numerator and denominator */  public Rational(long numerator, long denominator) {    long gcd = gcd(numerator,…

Chapter 18 Solutions

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

Ch. 18.4 - Prob. 18.4.2CPCh. 18.4 - Prob. 18.4.3CPCh. 18.5 - Prob. 18.5.1CPCh. 18.5 - Prob. 18.5.2CPCh. 18.5 - What is a recursive helper method?Ch. 18.6 - Prob. 18.6.1CPCh. 18.6 - How does the program get all files and directories...Ch. 18.6 - How many times will the getSize method be invoked...Ch. 18.6 - Will the program work if the directory is empty...Ch. 18.6 - Will the program work if line 20 is replaced by...Ch. 18.6 - Will the program work if lines 20 and 21 are...Ch. 18.7 - Prob. 18.7.1CPCh. 18.8 - Prob. 18.8.1CPCh. 18.8 - Prob. 18.8.2CPCh. 18.8 - How many times is the displayTriangles method...Ch. 18.8 - Prob. 18.8.4CPCh. 18.8 - Prob. 18.8.5CPCh. 18.9 - Which of the following statements are true? a. Any...Ch. 18.9 - Prob. 18.9.2CPCh. 18.10 - Identify tail-recursive methods in this chapter.Ch. 18.10 - Rewrite the fib method in Listing 18.2 using tail...Ch. 18 - Prob. 18.1PECh. 18 - Prob. 18.2PECh. 18 - (Compute greatest common divisor using recursion)...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Sum series) Write a recursive method to compute...Ch. 18 - (Fibonacci series) Modify Listing 18.2,...Ch. 18 - Prob. 18.8PECh. 18 - (Print the characters in a string reversely) Write...Ch. 18 - (Occurrences of a specified character in a string)...Ch. 18 - Prob. 18.11PECh. 18 - (Print the characters in a string reversely)...Ch. 18 - (Find the largest number in an array) Write a...Ch. 18 - (Find the number of uppercase letters in a string)...Ch. 18 - Prob. 18.15PECh. 18 - (Find the number of uppercase letters in an array)...Ch. 18 - (Occurrences of a specified character in an array)...Ch. 18 - (Tower of Hanoi) Modify Listing 18.8,...Ch. 18 - Prob. 18.19PECh. 18 - (Display circles) Write a Java program that...Ch. 18 - (Decimal to binary) Write a recursive method that...Ch. 18 - (Decimal to hex) Write a recursive method that...Ch. 18 - (Binary to decimal) Write a recursive method that...Ch. 18 - (Hex to decimal) Write a recursive method that...Ch. 18 - Prob. 18.25PECh. 18 - (Create a maze) Write a program that will find a...Ch. 18 - (Koch snowflake fractal) The text presented the...Ch. 18 - (Nonrecursive directory size) Rewrite Listing...Ch. 18 - (Number of files in a directory) Write a program...Ch. 18 - (Game: Knights Tour) The Knights Tour is an...Ch. 18 - (Game: Knights Tour animation) Write a program for...Ch. 18 - (Game: Eight Queens) The Eight Queens problem is...Ch. 18 - Prob. 18.35PECh. 18 - (Sierpinski triangle) Write a program that lets...Ch. 18 - (Hilbert curve) The Hilbert curve, first described...Ch. 18 - (Recursive tree) Write a program to display a...Ch. 18 - Prob. 18.39PE
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning