Reference no: EM13314997
Building a Binary Search Tree
In this assignment, you are to write a program that analyzes a selection of text, counting the number of times each word appears in the text. Your word counts must ignore capitalization, so the, The, THE, and tHe all increase the count for the word "the" by one. For purposes of this assignment, a word is any consecutive string of letters and the apostrophe character, so don't counts as a single word, and best-selling counts as two words: best and selling. Notice that a blank space will not necessarily occur between two words. Numbers such as 27 and 2/3 will NOT be counted as words.
You must store the words and the counts of the words in a single binary search tree. Each word occurring in the text can only be stored once in the tree. Call the structure for the nodes of the tree WordNode, and call the references in this structure left and right. Use Strings to store words in the tree. Call the class implementing the binary search tree WordTree. It must contain the following public methods:
- constructors
- add: adds the given word to the tree if it is not already in the tree OR increments the appropriate counter if it is already there. It returns nothing.
- countNodes: returns the number of words currently stored in the tree.
- countWordsWith4Chars: returns the number of words which have exactly four characters.
- print: display the words of the tree in alphabetical order, and next to each word, prints the number of times each word occurs in the text.
Three of these operations (all but add) must visit every node in the tree. One of these must use preorder traversal, one must use inorder traversal, and one must use postorder traversal. You must decide which to use for each method, but use comments to document the type of traversal used.
The WordTree class may have only one data member variable, root, and it must be private.
Your program should perform the following steps:
1. Prompt the user for the name of the file (a string). Use the string input by the user as an argument to open file:
2. Open the file on disk, and process its contents, adding unique words to the BST and increasing the counts of existing words if necessary
3. Repeat steps 1&2 until the user enters some sentinel value.
4. Print out the total number of nodes in your tree
5. Print out the number of words which have exactly four characters.
6. print out the contents of a tree in alphabetical order
Optional: if you have time, implement a method to delete every node from your BST that contains a word that is 3 or fewer letters long (note that you must explicitly make these deletions, not fail to insert these words in the first place).
Submission:
- Hand in your complete Java source code; and a copy of the results after running your program on given file
- Upload your source code to CMS
- Demonstrate your program to TA before/on the due day
Attachment:- ASSIGNMENT.rar
Calculate the gravitational force between earth and moon
: calculate the gravitational force between the earth and the moon in newtons. the distance between the earth and the moon is 384x10^3
|
Population of each country is in the labour force
: What are the similarities and differences between the three countries in terms of the percentage of the population that works in each type of industry?
|
What is the tension in the vertical wire
: The system shown above is in equilibrium. The steel block has a mass m1 = 234 kg, What is the tension in the vertical wire that holds the steel block
|
Determine the gravitational attraction between two spheres
: two identical spheres of radius 8 in and weighing 2 lb on the surface of the earth are placed in contact. find the gravitational attraction between them.
|
Define how to building a binary search tree
: Three of these operations (all but add) must visit every node in the tree. One of these must use preorder traversal, one must use inorder traversal, and one must use postorder traversal.
|
Determine the dimension of k in terms of the base dimensions
: when a force F acts on a linear spring, the elongation x of the spring is given by F=kx, where K is called the stiffness of the spring. Determine the dimension of K in terms of the base dimensions of an absolute system of units
|
What is the normal force the floor exerts on the ladder
: A ladder of length L = 2.6 m and mass m = 20 kg rests on a floor with coefficient of static friction %u03BCs = 0.54. What is the normal force the floor exerts on the ladder
|
Would the loss of life have been different and why
: As a civil engineer you look up in your strength of materials book and find out that the deflection, for a square beam of width, t, and length, L, when subjected to a tensile force, F, is given by: h=FL/(Et2), where E is Young's modulus.
|
Determine the required damping constant for the system
: A spring oscillator is designed with a mass of 0.113 kg. It operates while immersed in a damping fluid, determine the required damping constant for the system
|