Trie for Longest Prefix Match

Question

Suppose I have a route_table_entry structure with these fields:

typedef struct route_table_entry {
    uint32_t prefix;
    uint32_t next_hop;
    uint32_t mask;
    int interface;
} route_table_entry;

And I want to build a Trie for the Longest Prefix Match algorithm like this:

typedef struct trie {
    route_table_entry *entry;
    bool end;
    struct trie *child;
    struct trie *sibling;
} Trie;

Well, I'm not sure If that's actually the best way to store this, but what should I store in the Trie? How would I take in account that I get the maximum mask? First I did this with a routing_table structure that was sorted for the prefix and then decreasing for the mask and with a binary search that would be easy to find. But with a Trie how is it taken in account that I get the prefix with the highest mask when searching for the prefix?