dev/ll_tries.cpp
Node* LLInsert(Node* node, int key, struct TrieNode* address) { 
	/* If the list is empty, return a new node */
	if (node == NULL) return newNode(key,address); 

	/* Otherwise, go through the list */
	Node* run = node;
    while(run->next != NULL) {
        run = run->next;
    }

    run->next = newNode(key, address);

	/* Return the (unchanged) node pointer */
	return node; 
}
/* A utility function to insert a new node with given key in LL*/
A utility function to insert a new node with given key in LL
A utility function to insert a new node with given key in LL
Node* LLInsert(Node* node, int key, struct TrieNode* address) { 
	if (node == NULL) return newNode(key,address); 
	Node* run = node;
    while(run->next != NULL) {
        run = run->next;
    }
    run->next = newNode(key, address);
	return node; 
}
Node * LLInsert ( Node * node , int key , struct TrieNode * address ) { if ( node == NULL ) return newNode ( key , address ) ; Node * run = node ; while ( run -> next != NULL ) { run = run -> next ; } run -> next = newNode ( key , address ) ; return node ; }
A utility function to insert a new node with given key in LL
A utility function to insert a new node with given key in LL
/* If the list is empty, return a new node */ /* Otherwise, go through the list */ /* Return the (unchanged) node pointer */