Em Andamento

Binary Search Tree

The task is to process a file of text to produce a list of the 8-letter words contained in the document. To do this we must maintain a list of 8-letter words from the text. This can, of course, be done using an array. But it would not be very efficient. A better choice is to use a Binary Search Tree. With the Binary Search Tree, the word list will be maintained in alphabetical order. Design the program to process a text file (input the filename internally or through the command line). The output will be the alphabetical list of 8-letter words from the file. The program sequence should be: Repeat, for each line of text in the file; Read a String (a line of text). Decompose the string into tokens (the words). Then for _each 8-letter word_; search the Binary Search Tree for a node containing this word; if it is found, go to the next word. otherwise, insert a node for this word. The classes (etc.) you need are: class pTwoChildNode; class pGenericBinaryTree; class pBinarySearchTree; interface pComparable. Find a suitable text file, of at least two pages to test the program. Design your program so that the word length may be changed. Run your program again, to find the list of 10-letter words. Note: the data field of the BST nodes will be a String object, the word. You will need to implement the pComparable interface for String objects or use the regular JAVA Comparable interface for the comparisons.

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.

## Platform

Windows XP

Habilidades: Engenharia, Java, MySQL, PHP, Arquitetura de software, Teste de Software

Ver mais: word tree software, using binary search java, use binary search tree, tree node, tree insert, tree binary search, text string search, string source code java, source code binary search, search text string, search string array, search bst, search binary tree, search binary, search tree, order tree, order binary tree, order binary search, node tree, list binary search, java binary search code, java binary search, java array binary search, insert binary tree, find binary

Acerca do Empregador:
( 12 comentários ) United States

ID do Projeto: #2968389

Premiar a:

vw821235vw

See private message.

$15 USD em 3 dias
(94 Avaliações)
4.3

23 freelancers estão ofertando em média $24 para este trabalho

nlogicsoftware

See private message.

$42.5 USD in 3 dias
(36 Comentários)
7.4
teknowmagic

See private message.

$21.25 USD in 3 dias
(124 Comentários)
6.8
mihaiscortaru

See private message.

$25.49 USD in 3 dias
(160 Comentários)
6.0
emilianbold

See private message.

$17 USD in 3 dias
(80 Comentários)
5.9
ziksainc

See private message.

$25.5 USD in 3 dias
(62 Comentários)
5.2
yosevw

See private message.

$8.5 USD in 3 dias
(30 Comentários)
5.0
stevelb22

See private message.

$12.75 USD in 3 dias
(61 Comentários)
4.5
teamvw

See private message.

$17 USD in 3 dias
(36 Comentários)
3.8
uorgs

See private message.

$4.25 USD in 3 dias
(4 Comentários)
3.5
always99vw

See private message.

$17 USD in 3 dias
(22 Comentários)
3.4
mihaidanila

See private message.

$5.1 USD in 3 dias
(12 Comentários)
3.3
fabianjones

See private message.

$22.1 USD in 3 dias
(20 Comentários)
3.3
Softkarma

See private message.

$42.5 USD in 3 dias
(2 Comentários)
3.4
lemonsmasher

See private message.

$17 USD in 3 dias
(12 Comentários)
2.3
horizonconsultvw

See private message.

$85 USD in 3 dias
(4 Comentários)
2.3
kitovw

See private message.

$17 USD in 3 dias
(5 Comentários)
1.9
grzegorztwa

See private message.

$34 USD in 3 dias
(3 Comentários)
2.1
phdonnelly

See private message.

$12.75 USD in 3 dias
(2 Comentários)
1.6
vw914040vw

See private message.

$8.5 USD in 3 dias
(16 Comentários)
1.6
praetor3

See private message.

$42.5 USD in 3 dias
(0 Comentários)
0.0