Question

I need help with this code, I'm stuck on it, please remember step 4, I'm very much stuck on that part. It says something about putting how many times it appears

Assignment #1: Sorting with Binary Search Tree Through this programming assignment, the students will learn to do the following: Know how to process command line arguments. 1 Perform basic file I/O. 2. Use structs, pointers, and strings. Use dynamic memory. 3. 4. This assignment asks you to sort the lines of an input file (or from standard input) and print the sorted lines to an output file (or standard output). Your program, called bstsort (binary search tree sort), will take the following command line arguments: % bstsort [-c] [-o output_file_name] [input_file_name] If -c is present, the program needs to compare the strings case sensitive; otherwise, it's case insensitive. If the output_file_name is given with the -o option, the program will output the sorted lines to the given output file; otherwise, the output shall be the standard output. Similarly, if the input_file_name is given, the program will read from the input file; otherwise, the input will be from the standard input. You must use getopt() to parse the command line arguments to determine the cases. All strings will be no more than 100 characters long. In addition to parsing and processing the command line arguments, your program needs to do the following: cases. All strings will be no more than 100 characters long. In addition to parsing and processing the command line arguments, your program needs to do the following: You need to construct a binary search tree as you read from input. A binary search tree is a binary tree. Each node can have at most two child nodes (one on the left and one on the right), both or either one can be empty. If a child node exists, it's the root of a binary search tree (we call subtree). Each node contains a key (in our case, it's a string) and a count of how many of that string were included. If he left subtree of a node exists, it contains only nodes with keys less than the node's key. If the right subtree of a node exists, it contains only nodes with keys greater than the node's key. You can look up binary search tree on the web or in your Data Structure textbook. Note that you do not need to balance the binary search tree (that is, you can ignore all 1. those rotation operations) in this assignment. 2. Initially the tree is empty (that is, the root is null). The program reads from the input file (or stdin) one line at a time; If the line is not an empty line and the line is not already in the tree, it should create a tree node that stores a pointer to the string and a count of 1 indicating this is the first occurrence of that string, and then insert the tree node to the binary search tree. An empty line would indicate the end of input for stdin, an empty line or end of file would indicate the end of input for an input file. If the line is not an empty line and the line is already in the tree, increase the count for that node indicating that there are multiple instances of that line. You must develop two string comparison functions, one for case sensitive and the other for case 3. insensitive. You must not use the strcmp) and strcasecmp() functions provided by the C library. You must implement your own version. You will be comparing the ASCII values. Note that using ASCII, all capital letters come before all lower case letters Once the program has read all the input (when EOF is returned or a blank line encountered), the 4. program then performs an in-order traversal of the binary search tree to print out all the strings one line at a time to the output file or stdout. Next to the line include a count of how many times that line appeared. If the selection was for case insensitive then you should include either the first choice encountered, the last choice encountered or all capital letters. Before the program ends, it must reclaim the tree! You can do this by performing a post-order 5. traversal, i.e., reclaiming the children nodes before reclaiming the node itself. Make sure you also reclaim the memory occupied by the string as well. 6. It is required that you use getopt for processing the command line and use malloc or calloc and free functions for dynamically allocating and deallocating nodes and the buffers for the strings. It is required that you implement your own string comparison functions instead of using the corresponding libc functions. Here's an example: bash$ cat myfile bob is working. david is a new hire. Bob is working. alice is bob's boss. charles doesn't like bob. bash$ ./bstsort myfile 1 alice is bob's boss. 2 bob is working 1 charles doesn't like bob. 1 david is a new hire. Please submit your work through the inbox as one zip file. Follow the instructions below carefully (to avoid unnecessary loss of grade): You should submit the source code and the Makefile in the zip file called FirstnameLastnameA1 One should be able to create the executable by simply 'make'. The Makefile should also contain a 'clean' target for cleaning up the directory (removing all temporary files and object files). Make sure you don't include intermediate files: *.o, executables, *~, etc., in your submission. (There'll be a penalty for including unnecessary intermediate files). Only two files should be included unless permission is given for more, those would be bstsort.c, and Makefile. If you feel a need to include a bstsort.h file, please send me a note asking for permission.

Answer 1

SOLUTION :-

#include <string.h>
#include <stdbool.h>
#include <getopt.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>

typedef struct Node{
   char* key;
   int value;
   struct Node* left;
   struct Node* right;
}Node;

void removeEnterLine(char* line){
   char* ptr=&(line[0]);
   while(ptr!=NULL){
       if((*ptr)=='\n'){

           *ptr='\0';
           break;
       }
       ptr++;
   }
}

int strcmpCaseSensitive(char* str1,char* str2){
   char* ptr1=str1;
   char* ptr2=str2;
   while(ptr1!='\0' && ptr2!='\0'){
       if((*ptr1)>(*ptr2))
           return 1;
       else if((*ptr1)<(*ptr2))
           return -1;

       ptr1++;
       ptr2++;
   }

   if(ptr1=='\0' && ptr2=='\0')
       return 0;
   else if(ptr1=='\0')
       return -1;
   else
       return 1;
}

int strcmpCaseInsensitive(char* str1,char* str2){

  

   char* ptr1=str1;
   char* ptr2=str2;
   while(ptr1!='\0' && ptr2!='\0'){
       char ch1=*ptr1;
       char ch2=*ptr2;
       ch1=tolower(ch1);
       ch2=tolower(ch2);

       if(ch1>ch2)
           return 1;
       else if(ch1<ch2)
           return -1;

       ptr1++;
       ptr2++;
   }

   if(ptr1=='\0' && ptr2=='\0'){
       return 0;
   }
   else if(ptr1=='\0')
       return -1;
   else
       return 1;
}

int compareStrings(char* str1,char* str2,bool caseSensitive){

   if(caseSensitive==true){
       return strcmpCaseSensitive(str1,str2);
   }else{
       return strcmpCaseInsensitive(str1,str2);
   }
  
}

void insert(char* tmp,Node* root,bool caseSensitive){
   Node* temp=root;
   Node* parent=NULL;
   while(temp!=NULL){
       if(compareStrings(temp->key,tmp,caseSensitive)==0){
           temp->value=temp->value+1;
           return;
       }else if(compareStrings(temp->key,tmp,caseSensitive)>0){
           parent=temp;
           temp=temp->left;
       }else{
           parent=temp;
           temp=temp->right;
       }
   }

      
   Node* newest=(Node*)malloc(sizeof(Node)*1);
   newest->left=NULL;
   newest->right=NULL;
   newest->key=tmp;
   newest->value=1;

   if(compareStrings(parent->key,tmp,caseSensitive)>0){
       //printf("left\n");
       parent->left=newest;
   }else{
       //printf("right\n");
       parent->right=newest;
   }

}

void inorder(Node* root){
   if(root==NULL)
       return;
   inorder(root->left);
   int i;
   for(i=1;i<=root->value;i++)
       printf("%s\n", root->key);
   inorder(root->right);
}

int main(int argc,char** argv){

   bool caseSensitive=false;
   char* output="";
   char* input="";
   int c;
   while((c=getopt(argc,argv,"co:"))!=-1){
       switch(c){
           case 'c':
               caseSensitive=true;
               break;

           case 'o':
               output=optarg;
               break;
       }
   }

   int size=100000;
   char** arr=(char**)(malloc(sizeof(char*)*size));

   int index;  
   for (index = optind; index < argc; index++){
      input=argv[index];
   }

   int ind=0;
   if(strcmp(input,"")==0){ //std input
      size_t line_size;
      printf("Enter strings line by line\n");
      char* line=(char*)malloc(sizeof(char)*100);
      while(getline(&line,&line_size,stdin)!=-1){
          if(strcmp(line,"\n")==0)
              break;
          removeEnterLine(line);
          arr[ind++]=line;
          line=(char*)malloc(sizeof(char)*100);
     
      }

   }else{
      FILE *file = fopen(input, "r");
      char* line=(char*)malloc(sizeof(char)*100);
      size_t line_size;
     
      while(getline(&line,&line_size,file)!=-1){
          removeEnterLine(line);
          arr[ind++]=line;
          line=(char*)malloc(sizeof(char)*100);
     
      }

   }

   int j;
   // for(j=0;j<ind;j++)
   //   printf("%s\n", arr[j]);

   int sizeTree=0;
   Node* root;

   for(j=0;j<ind;j++){
      char* tmp=arr[j];
      if(sizeTree==0){
          Node* newest=(Node*)malloc(sizeof(Node)*1);
          newest->key=tmp;
          newest->value=1;
          newest->left=NULL;
          newest->right=NULL;
          root=newest;
      }else{
          insert(tmp,root,caseSensitive);
         
      }

       sizeTree++;     

   }

   inorder(root);

   return 0;
}

sample input:

hello
good
boy
dude
dude

//make sure there is \n line after last word in input file