Найти самое длинное/самое короткое слово в строке

/* ANSI C 99 with Glib-2.0 */
 
#include <stdio.h>
#include <string.h>
#include <glib.h>
 
int key_cmp(gconstpointer a, gconstpointer b) {
    return GPOINTER_TO_INT(a) - GPOINTER_TO_INT(b);
}
 
gboolean get_min_key(gpointer key, gpointer value, gpointer data) {
    *(int*)data = GPOINTER_TO_INT(key);
    return TRUE;
}
 
gboolean get_max_key(gpointer key, gpointer value, gpointer data) {
    *(int*)data = GPOINTER_TO_INT(key);
    return FALSE;
}
 
gboolean remove_words(gpointer key, gpointer value, gpointer data) {
    g_hash_table_destroy((GHashTable*)value);
    return FALSE;
}
 
void dump_hash(gpointer key, gpointer value, gpointer data) {
    printf("\t%s\n", (char*)key);
}
 
#define DELIM " \t\n"
 
int main(void) {
    char buf[BUFSIZ];
    
    while ( printf("String: ") && fgets(buf, BUFSIZ, stdin) && *buf != '\n' ) {
        char ** words = g_strsplit_set(buf, DELIM, -1);
        GTree * tree = g_tree_new(key_cmp);
        
        for ( char ** w = words; *w; ++w ) {
            if ( **w ) {
                int len = strlen(*w);
                GHashTable * hash = g_tree_lookup(tree, GINT_TO_POINTER(len));
                if ( ! hash ) {
                    hash = g_hash_table_new(g_str_hash, g_str_equal);
                    g_tree_insert(tree, GINT_TO_POINTER(len), hash);
                }
                g_hash_table_insert(hash, *w, NULL);
            }
        }
        
        int minLen, maxLen;
        g_tree_foreach(tree, get_min_key, &minLen);
        g_tree_foreach(tree, get_max_key, &maxLen);
        GHashTable * shortestWords = g_tree_lookup(tree, GINT_TO_POINTER(minLen));
        GHashTable * longestWords = g_tree_lookup(tree, GINT_TO_POINTER(maxLen));
        
        printf("Shortest words (%d symbols):\n", minLen);
        g_hash_table_foreach(shortestWords, dump_hash, NULL);
        printf("Longest words (%d symbols):\n", maxLen);
        g_hash_table_foreach(longestWords, dump_hash, NULL);
        
        g_tree_foreach(tree, remove_words, NULL);
        g_tree_destroy(tree);
        g_strfreev(words);
    }
    
    return 0;
}