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.
mafarjeh 0 Newbie Poster
mafarjeh 0 Newbie Poster
pl, be hurry as possible as you can
Duoas 1,025 Postaholic Featured Poster
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.
Salem 5,199 Posting Sage
http://www.catb.org/~esr/faqs/smart-questions.html#urgent
http://www.catb.org/~esr/faqs/smart-questions.html#homework
In fact, the whole ASQ should be required reading.
ithelp 757 Posting Virtuoso Banned
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?
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.