Traversal

//This function can be used on singly/doubly linked lists.
listTraverse (linkedList L) {
		currentNode = L->head;
		while(currentNode != NULL) {
			currentNode = currentNode->next;
		}
}

Search

//This function can be used on singly/doubly linked lists.
//dataType indicates whatever type the data in the LL may be.
listSearch (linkedList L, dataType key) {
		currentNode = L->head;
		while(currentNode != NULL) {
			if(currentNode->data == key) {
				return currentNode->data;
			}
			currentNode = currentNode->next;
		}
}