Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

COSC2430: Programming and Data Structures Print a file content in alphabetical order using AVL trees Introduction In this homework, you will create a C++ program

image text in transcribedimage text in transcribedimage text in transcribed

COSC2430: Programming and Data Structures Print a file content in alphabetical order using AVL trees Introduction In this homework, you will create a C++ program that uses an AVL tree to read an input file and print the words in the text in alphabetical order Input and Output The input is a single text file containing a paragraph of unknown length. Example 1 of input Once upon a time, there was a little girl who lived in a village near the forest. The output of your program should be a text file containing all the words in the original file in alphabetical order. Only words must enter the tree (follow rules of HW3. Punctuation and numbers (including words including numbers or special characters) will not be included in the output. Furthermore, duplicates are not allowed in the tree. All words should be listed on a new line with the first character uppercase. At the end of the output, you will write the number of rotations required to keep the tree balanced. Example 1 of output Forest Girl In Little Lived Near Once The There Time Upon Village Was Who COSC2430: Programming and Data Structures Print a file content in alphabetical order using AVL trees Introduction In this homework, you will create a C++ program that uses an AVL tree to read an input file and print the words in the text in alphabetical order Input and Output The input is a single text file containing a paragraph of unknown length. Example 1 of input Once upon a time, there was a little girl who lived in a village near the forest. The output of your program should be a text file containing all the words in the original file in alphabetical order. Only words must enter the tree (follow rules of HW3. Punctuation and numbers (including words including numbers or special characters) will not be included in the output. Furthermore, duplicates are not allowed in the tree. All words should be listed on a new line with the first character uppercase. At the end of the output, you will write the number of rotations required to keep the tree balanced. Example 1 of output Forest Girl In Little Lived Near Once The There Time Upon Village Was Who

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

XML Data Management Native XML And XML Enabled Database Systems

Authors: Akmal Chaudhri, Awais Rashid, Roberto Zicari, John Fuller

1st Edition

0201844524, 978-0201844528

More Books

Students also viewed these Databases questions

Question

8. Do the organizations fringe benefits reflect diversity?

Answered: 1 week ago