Question

Creat a C Program that Reads words from a file called words, which contains one word per line.Each word has maximum

length to M.The number of words in the file is equal to N.

Incert each word to Binary Search Tree with node name dictionary.Each node of the tree must contain one word.The left child must contain a word that it is lexicographically smaller while the right child contains a lexicographically bigger one.

1) When you finish reading the file, ask form the user to give a word as input.

2) Create a function SearchWord that search for a word and return 1 if the word is found or 0 if the word does not exist.

3) Create a function to print the words exactly as they appear in the file.

4) Create a function PrintSorted that prints all the words in a lexicographical order.

## : Choose a value for M and N.N should be greater than 10.

Answer 1

E ConsoleTasksProblems Memory ExecutablesSearch <terminated> Test [C/C++ Application] /home/uday.rathkantwar/workspaceNew/Test/Debug/Test (11/29/15 4:44 PM) Enter Data loaded successfully from file Test.txt file Name: Test.txt Program For Binary Search Tree 1.Search 2.PrintSorted Tree 3.Exit Enter your choice :2 Hello Programming World 1.Search 2.PrintSorted Tree 3.Exit Enter your choice :1 Enter Element to be searched :Hello Search result is 1 1.Search 2.PrintSorted Tree 3.Exit Enter your choice :1 Enter Element to be searched :HE Search result is o

======================================================

Program name BinarySearch.c

======================================================

# include <stdio.h>
# include <stdlib.h>
int N = 50;
int M = 20;
typedef struct BST {
   char data[50];
   struct BST *lchild, *rchild;
} node;

void insert(node *, node *);
void PrintSorted(node *);
int search(node *root, char key[], node **parent);

int main() {

   int choice, res;
   char key[N], fileName[50], oneword[100];
   FILE *fp1;
   char c;

   node *new_node, *root, *parent;
   node *get_node();
   root = NULL;

   printf("Enter file Name: ");
   scanf("%s", fileName);

   fp1 = fopen(fileName, "r");

   do {
       c = fscanf(fp1, "%s", oneword); /* got one word from the file */
       new_node = get_node();

       strcpy(new_node->data, oneword);

       if (root == NULL) /* Tree is not Created */
           root = new_node;
       else
           insert(root, new_node);

   } while (c != EOF);

   printf("Data loaded successfully from file %s", fileName);
   fclose(fp1);

   printf("\n\nProgram For Binary Search Tree ");
   do {
       printf("\n\n1.Search");
       printf("\n2.PrintSorted Tree");
       printf("\n3.Exit");
       printf("\nEnter your choice :");
       scanf("%d", &choice);

       switch (choice) {

case 1:

           printf("\nEnter Element to be searched :");
           scanf("%s", key);

           res = search(root, key, &parent);
           printf("\nSearch result is %d", res);
           break;

       case 2:
           if (root == NULL)
               printf("Tree Is Not Created");
           else {
               PrintSorted(root);
           }
           break;
       default:
           printf("Invalid Choice!");

       }

   } while (choice != 3);

   return 0;
}
/*
Get new Node
*/
node *get_node() {
   node *temp;
   temp = (node *) malloc(sizeof(node));
   temp->lchild = NULL;
   temp->rchild = NULL;
   return temp;
}
/*
This function is for creating a binary search tree
*/
void insert(node *root, node *new_node) {
   if (strcmp(new_node->data, root->data) < 0) {
       if (root->lchild == NULL)
           root->lchild = new_node;
       else
           insert(root->lchild, new_node);
   }

   if (strcmp(new_node->data, root->data) > 0) {
       if (root->rchild == NULL)
           root->rchild = new_node;
       else
           insert(root->rchild, new_node);
   }
}
/*
This function is for searching the node from
binary Search Tree
*/
int search(node *root, char key[], node **parent) {
   node *temp;
   temp = root;
   while (temp != NULL) {
       if (strcmp(temp->data, key) == 0) {
           return 1;
       }
       *parent = temp;

       if (temp->data > key)
           temp = temp->lchild;
       else
           temp = temp->rchild;
   }
   return 0;
}
/*
This function displays the tree in sorted fashion
*/
void PrintSorted(node *temp) {
   if (temp != NULL) {
       PrintSorted(temp->lchild);
       printf("%s ", temp->data);
       PrintSorted(temp->rchild);
   }
}