
Introduction to Java Programming and Data Structures Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134700144
Author: Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 25, Problem 25.17PE
Program Plan Intro
Program Plan:
- Include the required import statement.
- Define the main class.
- Declare the necessary variables
- Using start initialize the required.
- Create border pane, tree view, text field and button.
- Set the tree view as center, alignment.
- Add an action event to the button.
- Create a scene and place the pane in the stage.
- Set the title.
- Place the scene in the stage.
- Display the stage.
- Define the main method using public static main.
- Initialize the call.
- Define “decode” method.
- Declare the variable
- Check the length of the “bits”.
- If the “bits” value is “0” set that value into left subtree, if the “bits” value is “1” set the value into right subtree.
- If the left subtree is null, leaf is detected and restart from the root.
- Return the “result”.
- Define “encode” method.
- Declare and set the value.
- Check the length of the “text”.
- Calculate the result.
- Return the “result”.
- Define “getCode” method.
- Check the “root” value is null
- The variable “codes” is declared and allocates memory for that variable.
- Call the “assignCode” method.
- Return the “codes” value.
- Define “assignCode” method.
- Check if root of left subtree value is not null.
- If the condition is true, calculate the left and right subtree value and call the “assignCode” method with the respective parameters.
- Otherwise calculate the “root” element value.
- Check if root of left subtree value is not null.
- Define “getHuffmanTree” method.
- Create a heap to hold the trees.
- Add the values into the heap tree.
- If the heap tree is greater than 1, remove the smallest and next smallest weight from the tree and combine the two trees.
- Finally return the tree.
- Define “getCharacterFrequency” method.
- Declare the variable.
- The try-catch block is used to check the input file is present or not and count the number of characters in that file.
- Return the total counts.
- Define “TreeView” class.
- Declare the required variables.
- Define the constructor.
- Define the “setTree” method.
- Add the value.
- Call the “repaint” method.
- Define the “repaint” method.
- Clear the pane
- Display the tree recursively.
- Define the “displayTree” method.
- Check if the left node value is not equal to null.
- Draw a line to the up node.
- Draw the left subtree recursively.
- Check if the right node value is not equal to null.
- Draw a line to the down node.
- Draw the left subtree recursively.
- Display the node.
- Check if the left node value is not equal to null.
- Define “Tree” class.
- Declare the variable.
- Create a tree with two subtrees,
- Create a tree containing a leaf node.
- Compare the trees based on their weights.
- Define “Node” class.
- Declare the required variables.
- Create a default constructor.
- Create a node with the particular weight and character.
- Define “Heap” class.
- Create the object for the ArrayList
- Create the default constructor.
- Create a heap from an array of objects.
- Define “add” method.
- Add the new object into the heap.
- Check the “currentIndex” value is greater than 0.
- Swap if the current object is greater than its parents.
- Assign “parentIndex” value into “currentIndex” variable.
- Define “remove” method.
- Check the condition and remove the root from the heap.
- Declare and compute the left and right child index.
- Then find the maximum value between two children.
- Swap if the current node is less than maximum value.
- Finally return the value.
Expert Solution & Answer

Trending nowThis is a popular solution!

Students have asked these similar questions
I need to define and discuss the uses of one monitoring or troubleshooting tool in Windows Server 2019. thank you
I would likr toget help with the following concepts:
- Windows Server features
- Windows Server versus Windows 10 used as a client-server network
I need to define and discuss the uses of one monitoring or troubleshooting tool in Windows Server 2019. thank you
Chapter 25 Solutions
Introduction to Java Programming and Data Structures Comprehensive Version (11th Edition)
Ch. 25.2 - Prob. 25.2.1CPCh. 25.2 - Prob. 25.2.2CPCh. 25.2 - Prob. 25.2.3CPCh. 25.2 - Prob. 25.2.4CPCh. 25.2 - Prob. 25.2.5CPCh. 25.3 - Prob. 25.3.1CPCh. 25.3 - Prob. 25.3.2CPCh. 25.3 - Prob. 25.3.3CPCh. 25.3 - Prob. 25.3.4CPCh. 25.4 - Prob. 25.4.1CP
Ch. 25.4 - Prob. 25.4.2CPCh. 25.4 - Prob. 25.4.3CPCh. 25.4 - Prob. 25.4.4CPCh. 25.4 - Prob. 25.4.5CPCh. 25.5 - Prob. 25.5.1CPCh. 25.5 - Prob. 25.5.2CPCh. 25.5 - Prob. 25.5.3CPCh. 25.5 - Prob. 25.5.4CPCh. 25.5 - Prob. 25.5.5CPCh. 25.6 - Prob. 25.6.1CPCh. 25.6 - Prob. 25.6.2CPCh. 25.6 - Prob. 25.6.3CPCh. 25.6 - How do you replace lines 9499 in Listing 25.11...Ch. 25 - Prob. 25.1PECh. 25 - (Implement inorder traversal without using...Ch. 25 - (Implement preorder traversal without using...Ch. 25 - (Implement postorder traversal without using...Ch. 25 - Prob. 25.6PECh. 25 - Prob. 25.7PECh. 25 - (Implement bidirectional iterator) The...Ch. 25 - Prob. 25.9PECh. 25 - Prob. 25.10PECh. 25 - Prob. 25.11PECh. 25 - (Test BST) Design and write a complete test...Ch. 25 - (Modify BST using Comparator) Revise BST in...Ch. 25 - Prob. 25.15PECh. 25 - (Data compression: Huffman coding) Write a program...Ch. 25 - Prob. 25.17PECh. 25 - (Compress a file) Write a program that compresses...Ch. 25 - (Decompress a file) The preceding exercise...
Knowledge Booster
Similar questions
- Please solve and answer the questions correctly please. Thank you!!arrow_forwardConsidering the TM example of binary sum ( see attached)do the step-by-step of execution for the binary numbers 1101 and 11. Feel free to use the Formal Language Editor Tool to execute it; Write it down the current state of the tape (including the head position) and indicate the current state of the TM at each step.arrow_forwardI need help on inculding additonal code where I can can do the opposite code of MatLab, where the function of t that I enter becomes the result of F(t), in other words, turning the time-domain f(t) into the frequency-domain function F(s):arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageEBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,Programming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage

EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT

C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr

Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,

Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning