Parse error before string constant?

[skev21]

Hi I am incredibly new to C++ programming and am sure my code is an absolute mess:

#include <iostream>
#include <stdlib.h>
struct listNode {
	int value;
	struct listNode *next;
	};
typedef struct listNode LISTNODE;
LISTNODE *createList(void);
LISTNODE *addNodeAfter(LISTNODE *list, int node);
LISTNODE *getNextNode(LISTNODE *thisNode);
int setNodeValue(LISTNODE *list, int node, int value);
int getNodeValue(LISTNODE *list, int node, int *value);
main()
{
	LISTNODE *listStart=0;
	int nodeValue, count;
	listStart=createList();
	if (listStart == 0) {
		cout << "Failed create the list !\n";
		}
	cout << "Created linked list starting at : " << listStart "\n";
	if (!setNodeValue(listStart, 0, 1234)) {
		cout << "Failed to set the first node value !\n";
		}
	if (!getNodeValue(listStart, 0, &nodeValue)) {
		cout << "Failed to get the first node value !\n";
		}
	cout << "The first node has a value of: " << nodeValue "\n";
	if (!addNodeAfter(listStart, 0)) {
		cout << "Failed to create new node !\n";
		}
	if (!setNodeValue(listStart, 1, 5678)) {
		cout << "Failed to set the second node value !\n";
		}
	if (!getNodeValue(listStart, 1, &nodeValue)) {
		cout << "Failed to get the second node value !\n";
		}
	cout << "The second node has a value of: " << nodeValue "\n";
	for (count=2; count<100; count++) {
		if (!addNodeAfter(listStart, count-1)) {
			cout << "Failed to create node %i !\n",count+1;
			break;
			}
		setNodeValue(listStart, count, 11*count);
		}
	getNodeValue(listStart, count/2, &nodeValue);
	cout << "Node " << count/2 "has value: " << nodeValue "\n";
	return 0;
	}
LISTNODE *createList(void)
{
	LISTNODE *newList;
	newList=(LISTNODE *)malloc(sizeof(LISTNODE));
	if (newList != NULL) {
		newList->value=0;
		newList->next=0;
		}
	return newList;
	}
LISTNODE *addNodeAfter(LISTNODE *list, int node)
{
	int count=0;
	LISTNODE *thisNode, *nextNode, *newNode;
	thisNode=list;
	newNode=(LISTNODE *)malloc(sizeof(LISTNODE));
	if (newNode == NULL) {
		return NULL;
		}
	newNode->value=0;
	while (thisNode != 0) {
		if (count == node) {
			nextNode=getNextNode(thisNode);
			newNode->next=nextNode;
			thisNode->next=newNode;
			return newNode;
			}
		count++;
		thisNode=getNextNode(thisNode);
		}
	return NULL;
	}
LISTNODE *getNextNode(LISTNODE *thisNode)
{
	return thisNode->next;
	}
int setNodeValue(LISTNODE *list, int node, int value)
{
	int count=0;
	LISTNODE *thisNode;
	thisNode=list;
	while (thisNode != 0) {
		if (count == node) {
			thisNode->value=value;
			return 1;
			}
		count++;
		thisNode=getNextNode(thisNode);
		}
	return 0;
	}
int getNodeValue(LISTNODE *list, int node, int *value)
{
	int count=0;
	LISTNODE *thisNode;
	thisNode=list;
	while (thisNode != 0) {
		if (count == node) {
			*value=thisNode->value;
			return 1;
			}
		count++;
		thisNode=getNextNode(thisNode);
		}
	return 0;
	}

I tried compiling and it said I had a "parse error before string constant" error on the lines that are in red.

[ಠ_ಠ]

you didn't put a << before "\n"

[skev21]

Thank you very much, I've been staring at it for ages...

edit: I've been asked to try overloading the > operator so I can compare 2 linkedList objects and use this to implement a sort() method in the linkedList class that puts the items in ascending order of value. I'm sure there is a simple way of doing this but that sounds like a foreign language to me. Is there a short and simple way of going about this. Any help would be greatly appreciated.