Jr1lT3 - Online C++ Compiler & Debugging Tool

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<limits.h>
#include<math.h>
#include<string.h>
#include<stdbool.h>

typedef long long ll ;

      // trie dictionnary

     typedef struct Trienode{
        char letter;
        bool isword;
        struct Trienode *children[26];
     }Trienode;

     Trienode *createTrienode(char c){
        Trienode *to = (Trienode *)malloc(sizeof(Trienode));
        to->letter=c;
        to->isword=false;
        for(int i=0;i<26;i++){
           to->children[i]=NULL;
        }
        return to;
     }

     //1
     Trienode *insertword(Trienode *root,char *word){
        if(!root) root=createTrienode('\0');
        if(!*word) return root;
        char *ptr =word ;
        Trienode *temp=root;
        while(*ptr){
           if(!temp->children[*ptr-'a']) temp->children[*ptr-'a']=createTrienode(*ptr);
           temp=temp->children[*ptr-'a'];
           ptr++;
        }
        temp->isword=true;
        return root;
     }

     //2
     bool search(Trienode *root , char *word){
        if(!root) return false;
        Trienode *temp=root;
        char *ptr = word;
        while(*ptr){
           if(!temp->children[*ptr-'a']) return false;
           temp=temp->children[*ptr-'a'];
           ptr++;
        }
        return temp->isword;
     }

     //3
      void dfs(Trienode *root,char *buffer,char *prefix,int depth){
        if(!root) return;
        if(root->isword){
           buffer[depth]='\0';
           if(strncmp(buffer,prefix,strlen(prefix))==0)
            printf("%s\n",buffer);
        }
        for(int i=0;i<26;++i){
           if(root->children[i]){
                buffer[depth]='a'+i;
                dfs(root->children[i],buffer,prefix,depth+1);
           }
        }
     }

     void show_all_words(Trienode *root,char *prefix){
        char buffer[100];
        dfs(root,buffer,prefix,0);
     }

    int main() {
    Trienode *root = NULL;

    // Insert words
    root = insertword(root, "all");
    root = insertword(root, "ally");
    root = insertword(root, "bat");
    root = insertword(root, "bath");
    root = insertword(root, "ball");
    root = insertword(root, "mehdi");
    root = insertword(root, "mehdiisthebest");

    printf("Words in trie:\n");
    show_all_words(root,"ba");

    return 0;
}