Using C++ how can I use Binary Search Tree (BST) to update a file.The code needs to be a menu-driven application that can:read a file and store the words and their count in BSTstore words that have at least 4 letters, ignore the restthere will be no words with ' (he's - for example will not be in the input file)print the words and their count in alphabetical order (A-Z) in a table formatsearch for a worddisplay the count and the word if founddelete a worddelete the word from the BST ANDreplace each occurrence of the word with a number of Xs equal to the length of the word; for example, delete word "camp", in the input file every occurrence of the word "camp" is replaced with XXXX use the search function you wrote for the search option to locate the word and delete itquitAlso, how could I implement the BST as a linked list and how could I replace the words in the file with X's Test File:this november is wikipedia asian monthjoin wam contests and win postcards from asiahelp with translationstreaty of versaillesfrom wikipedia the free encyclopediajump to navigationjump to searchthis article is about the treaty of versailles of june at the end of world war i for other uses see treaty of versailles disambiguationtreaty of versaillestreaty of peace between the allied and associated powers and germanyncover of the english versionsigned junelocationhall of mirrors in the palace of versailles paris franceeffective januaryconditionratification by germany and three principal allied powersnsignatoriesshowprincipal allied and associated powersnshowallied and associated powersndepositaryfrench governmentnlanguagesfrench and englishnfull texttreaty of versailles at wikisourceparis peace conference

Summary :-We got the output.Answer: -#include <bits/stdc++.h>using namespace std;const int ALPHABET_SIZE = 26;struct TrieNode{ struct TrieNode *children[ALPHABET_SIZE]; bool isEndOfWord;};struct TrieNode *getNode(void){ struct TrieNode *pNode = new TrieNode; pNode->isEndOfWord = false; for (int i = 0; i < ALPHABET_SIZE; i++) pNode->children[i] = NULL; return pNode;}void insert(struct TrieNode *root, string key){ struct TrieNode *pCrawl = root; for (int i = 0; i < key.length(); i++) { int index = key[i] - 'a'; if (!pCrawl->children[index]) pCrawl->children[index] = getNode(); pCrawl = pCrawl->children[index]; } pCrawl->isEndOfWord = true;}bool search(struct TrieNode *root, string key){ struct TrieNode *pCrawl = root; for (int i = 0; i < key.length(); i++) { int index = key[i] - 'a'; if (!pCrawl->children[index]) return false; pCrawl = pCrawl->children[index]; } return (pCrawl->isEndOfWord);}int main(){ string keys[] = {"the", "a", "there", "answer", "any", "by", "bye", "their" }; int n = sizeof(keys)/sizeof(keys[0]); struct TrieNode *root = getNode(); for (int i = 0; i < n; i++) insert(root, keys[i]); search(root, "the")? cout << "Yes\n" : cout << "No\n"; search(root, "these")? cout << "Yes\n" : cout << "No\n"; return 0;} Code: - OUTPUT: -

Answered: Using C++ how can I use Binary Search…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Using C++ how can I use Binary Search Tree (BST) to update a file.

The code needs to be a menu-driven application that can:

read a file and store the words and their count in BST
- store words that have at least 4 letters, ignore the rest
- there will be no words with ' (he's - for example will not be in the input file)
print the words and their count in alphabetical order (A-Z) in a table format
search for a word
- display the count and the word if found
delete a word
- delete the word from the BST AND
- replace each occurrence of the word with a number of Xs equal to the length of the word; for example, delete word "camp", in the input file every occurrence of the word "camp" is replaced with XXXX
- use the search function you wrote for the search option to locate the word and delete it
quit

Also, how could I implement the BST as a linked list and how could I replace the words in the file with X's

Test File:
this november is wikipedia asian month
join wam contests and win postcards from asia
help with translations
treaty of versailles
from wikipedia the free encyclopedia
jump to navigation
jump to search
this article is about the treaty of versailles of june at the end of world war i for other uses see treaty of versailles disambiguation
treaty of versailles
treaty of peace between the allied and associated powers and germanyn
cover of the english version
signed june
locationhall of mirrors in the palace of versailles paris france
effective january
conditionratification by germany and three principal allied powersn
signatories
show
principal allied and associated powersn
show
allied and associated powersn
depositaryfrench governmentn
languagesfrench and englishn
full text
treaty of versailles at wikisource
paris peace conference

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions