On Medium. :)

Definition:

Heaps are a binary tree with a structural property in which all heaps are a complete binary tree (when coded we dont use linked lists with left and right pointers, rather we trace through an array and manipulating the array as if it was a complete binary tree). Heaps must also have all of its nodes in a specific order, following the heap order property.

What makes a heap, a heap? First, ask yourself this…

Definition:

A Trie is a static tree-like data structure in which each node has 26 children pointers representing the letters of the English alphabet. The strings or words can be retrieved by traversing down a branch path of the tree. When traversing down a path the count will indicate if the string is a word and count its popularity.

1
2
3
4
5
typedef struct trieNode
{
    int count; 
    struct trieNode *children[26];
} trieNode;