Introduction to Java Programming and Data Structures  Comprehensive Version (11th Edition)
Introduction to Java Programming and Data Structures Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134700144
Author: Liang
Publisher: PEARSON
Question
Book Icon
Chapter 23, Problem 23.10PE
Program Plan Intro

Heap visualization

Program Plan:

  • Import the required packages.
  • Create a class “Myclass”:
    • New heap gets created.
    • New text field gets created.
    • New heap view gets created.
    • New button gets created.
    • Using start initialize the required.
      • New hbox gets created.
      • Set the count.
      • Add the label.
      • Set the style.
      • New border pane gets created.
      • Align and position the pane.
      • Create a scene based on the defined positions.
      • Set title for the preview.
      • Display the results based on the mouse action made.
      • The node gets add and removed based on the action defined.
    • Define the class “Heap”
      • New list gets defined.
      • New heap empty gets created.
      • Define the method “Heap()”
        • Loop that iterates to add the elements into the heap.
      • Define the method “add()”
        • Add the object.
        • Loop that iterates for the values present and add them after validation.
      • Define the method “remove()”
        • Condition to validate the elements of the list
        • Loop that iterates to remove the elements present in the list.
      • Define the method “getSize()”
        • Size of the list gets returned.
    • Define the class “HeapView()”
      • Declare and define the required varibles.
      • Call the method “repaint()”
        • Clear the pane.
        • Display the tree method is called.
      • Define the method “displayTree”
        • Condition to validate the value of the heap size.
        • New circle gets created.
        • Set the fill color and stroke color.
        • Add the elements at the required position based on the validation.
        • Display the heap.
      • Define the method “connectLeftchild”
        • Define the gap.
        • Set the x and y coordinates.
        • Add the elements.
      • Define the method “connectRightchild”
        • Define the gap.
        • Set the “x” and “y” coordinates.
        • Add the elements.
    • Define the main method.
      • Initialize the call.

Blurred answer
Students have asked these similar questions
a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]
a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]
If a new entity Order_Details is introduced, will it be a strong entity or weak entity? If it is a weak entity, then mention its type (ID or Non-ID, also Justify why)?
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
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning