Similar Books

    No books found

Title
Chapter: 25 / Q: 9
(Tree clone and equals) Implement the clone and equals methods in the BST class. Two BST trees are equal if they contain the same elements. The clone method returns an identical copy of a BST
Chapter: 25 / Q: 10
(Preorder iterator) Add the following method in the BST class that returns an iterator for traversing the elements in a BST in preorder
Chapter: 25 / Q: 11
(Display tree) Write a new view class that displays the tree horizontally with the root on the left as shown in Figure 25.23
Chapter: 25 / Q: 12
(Test BST) Design and write a complete test program to test if the BST class in Listing 25.5 meets all requirements
Chapter: 25 / Q: 13
(Add new buttons in BSTAnimation) Modify Listing 25.9, BSTAnimation.java, to add three new buttons—Show Inorder, Show Preorder, and Show Postorder— to display the result in a label, as shown in Figure 25.24
Chapter: 25 / Q: 14
(Generic BST using Comparator) Revise BST in Listing 25.5, using a generic parameter and a Comparator for comparing objects. Define a new constructor with a Comparator as its argument as follows:
Chapter: 25 / Q: 15
(Parent reference for BST) Redefine TreeNode by adding a reference to a node’s parent, as shown below:
Chapter: 25 / Q: 16
(Data compression: Huffman coding) Write a program that prompts the user to enter a file name, then displays the frequency table of the characters in the file and displays the Huffman code for each character
Chapter: 25 / Q: 17
(Data compression: Huffman coding animation) Write a program that enables the user to enter text and displays the Huffman coding tree based on the text, as shown in Figure 25.25a
Chapter: 25 / Q: 18
(Compress a file) Write a program that compresses a source file into a target file using the Huffman coding method
total questions: 772

Questions

772

Views

Best Answers

299

Points

5