dev/ll_tries.cpp
Node *newNode(int item, struct TrieNode *address) {

    Node *temp = (Node *)malloc(sizeof(Node)); 
    memory += sizeof(Node) + 8; //Size of Node + Pointer size
    temp->key = item;
    temp->address = address;
    temp->next = NULL;
    return temp;
}
// A utility function to create a new linked list node 
A utility function to create a new linked list node
A utility function to create a new linked list node
Node *newNode(int item, struct TrieNode *address) {
    Node *temp = (Node *)malloc(sizeof(Node)); 
    memory += sizeof(Node) + 8; 
    temp->key = item;
    temp->address = address;
    temp->next = NULL;
    return temp;
}
Node * newNode ( int item , struct TrieNode * address ) { Node * temp = ( Node * ) malloc ( sizeof ( Node ) ) ; memory += sizeof ( Node ) + 8 ; temp -> key = item ; temp -> address = address ; temp -> next = NULL ; return temp ; }
A utility function to create a new linked list node
A utility function to create a new linked list node
//Size of Node + Pointer size