3. We can use a binary search tree to keep track the word frequencies in a text. The conventionis that the left branch holds lexicographically smaller words, and the right larger. Your taskis to implement addWord (). If the word exists in the tree, you should increment its count. Ifit is a new word, you should allocate a new tree node, allocate enough memory to store theword, make a copy of it, set its count to 1, and insert the new node in the proper place.Additionally, draw the tree after the words from Gettysburg are added.char *Gettysburg = { “government”, “of”, “the”, “people”,”by”, “the”, “people”, “for”, “the”, “people”,”shall”, “not”, “perish”, “from”, “the”, “earth” };typedef struct tree {char *word;int count;struct tree *left, *right;} Tree;Tree *addWord (Tree *ptr, const char word ) {Tree root = NULL;for (int i = 0; i < 16; i++)root = addWord(root, Gettysburg[i] );


Homework Essay Writers

Lets Start Working

Plagiarism Free

We use anti-plagiarism software to ensure you get high-quality, unique papers. Besides, our writers have a zero plagiarism mentality

On Time Delivery

Your essay will be delivered strictly within the deadline.  If you have an urgent order, we can do it!

Money Back Guarantee

We offer warranty service, including free revisions, and a right to request a refund incase your expectations are not met!


Our Advantage

  • Say “NO” to plagiarism – FREE plagiarism report as an addition to your paper
  • The lowest prices that fit excellent quality
  • Authorship – you are the one who possesses the paper. We DO NOT re-sale or re-use any of them.


Our Freebies

  • Free Cover Page
  • Free Revisions
  • Free Reference Page
  • Free 24/7 support

Pin It on Pinterest

Share This