0

hi for all
pl, if any can do the folowing:
" Write a cross-reference program which constructs a BST with all words
included from a text file and records the line numbers on which these words
were used. These line numbers should be stored on linked lists associated with
the nodes of the tree. After the input file has been processed, print in alphabetical
order all words of the text file along with the corresponding list of numbers of
the lines in which the words occur."
thanks for all.

4
Contributors
4
Replies
5
Views
10 Years
Discussion Span
Last Post by ithelp
0

No. Do your own homework.

If you want help along the way, post what it is that is giving you trouble and we'll help.

0

You do not need separate link list to store the line number, you can store in the binary search tree node only. How many marks will you get if you do this homework?

This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.