parser/src/LinkedListAPI.c
Node* initializeNode(void* data){
	Node* tmpNode = (Node*)malloc(sizeof(Node));
	
	if (tmpNode == NULL){
		return NULL;
	}
	
	tmpNode->data = data;
	tmpNode->previous = NULL;
	tmpNode->next = NULL;
	
	return tmpNode;
}
/**Function for creating a node for the linked list. 
* This node contains abstracted (void *) data as well as previous and next
* pointers to connect to other nodes in the list
* @pre data should be of same size of void pointer on the users machine to avoid size conflicts. data must be valid.
* data must be cast to void pointer before being added.
* @post data is valid to be added to a linked list
* @return On success returns a node that can be added to a linked list. On failure, returns NULL.
* @param data - is a void * pointer to any data type.  Data must be allocated on the heap.
**/
Function for creating a node for the linked list.
This node contains abstracted (void *) data as well as previous and next
pointers to connect to other nodes in the list
Function for creating a node for the linked list . This node contains abstracted ( void * ) data as well as previous and next pointers to connect to other nodes in the list
Node* initializeNode(void* data){
	Node* tmpNode = (Node*)malloc(sizeof(Node));
	if (tmpNode == NULL){
		return NULL;
	}
	tmpNode->data = data;
	tmpNode->previous = NULL;
	tmpNode->next = NULL;
	return tmpNode;
}
Node * initializeNode ( void * data ) { Node * tmpNode = ( Node * ) malloc ( sizeof ( Node ) ) ; if ( tmpNode == NULL ) { return NULL ; } tmpNode -> data = data ; tmpNode -> previous = NULL ; tmpNode -> next = NULL ; return tmpNode ; }
Function for creating a node for the linked list.
Function for creating a node for the linked list .