Thread: class problem

I cannot get started with this project. Can anyone help?
Create a file, link.h that contains the definition of a struct Node. Should have 2 parts data and link. Your link.h file should containg a prototype of three functions: delrep(), invert() and PRintlinked().
Create a file, link.cpp with the 3 functions.
Thedelrep has one paramater a head pointer to a linked list of ints. With a return type of delrep() of void.
The inver() has one parameter, a head pointer to a linked list of ints.
The function Printlinked() has one parameter, again a head pointer to a linked list of ints. Return type is void.
linktest.cpp should contain the main()function. Should create a list, call to print, then reverse the order , again call to print call delrep() to delter the duplicates and then call printlinked again to print again.

I have my printlinked funtion as:
void Printlinked(Node*headptr)
{
Node*cursor:
for(cursor_headptr;cursoe !=NULL; cursor+cursor->link)
cout<<cursor->data<< " ";

Need help with delrep() and invert() & main.

Ok so maybe I am a dyslexic chimpanzee, but I didn't get any help to get started yet!:
My main :
void Main()
{
int x
Node* head
head=NULL
Node*ptr;

cout<< "Pleae enter a list of integers, 0 when done: << endl;
cin x;
while(x!=0)
{
ptr=new Node;
ptr-> data=x;
ptr-> link=head;
head=ptr;
cin x;
}
cout<< endl;
cout<< "Here is your list of integers: << endl;
Printlinked(head)
Invert(head)
Printlinked(head);
Delrep(head);
Printlinked(head);


Here is my struct:
STRUCT Node
{
int data;
Node* link;
}

I have a poor perception of how to fix my Printlinked so that it doesn't look like a dyslexic chimpanzee, so you'd better tell me.
Thanks

int main()
{
int x
Node* head
head=NULL
Node*ptr;

cout<< "Pleae enter a list of integers, 0 when done" << endl;
cin >>x;
while(x!=0)
{
ptr=new Node;
ptr-> data=x;
ptr-> link=head;
head=ptr;
cin >>x;
}
cout<< endl;
cout<< "Here is your list of integers: << endl;
Printlinked(head)
cout<< "Here is your list of integers in reverse"<<endl;
Invert(head)
Printlinked(head);
cout << "Here is your list of integers with duplicates deleted"<<endl;
Delrep(head);
Printlinked(head);


Here is my struct:
STRUCT Node
{
int data;
Node* link;
}

Code:

int main()
{
int x
Node* head
head=NULL
Node*ptr;

cout<< "Pleae enter a list of integers, 0 when done" << endl;
cin >>x;
while(x!=0)
{
ptr=new Node;
ptr-> data=x;
ptr-> link=head;
head=ptr;
cin >>x;
}
cout<< endl;
cout<< "Here is your list of integers: << endl;
Printlinked(head)
cout<< "Here is your list of integers in reverse"<<endl;
Invert(head)
Printlinked(head);
cout << "Here is your list of integers with duplicates deleted"<<endl;
Delrep(head);
Printlinked(head);

Here is my struct:
STRUCT Node
{
int data;
Node* link;
}

Here are a few linked lists problems and solutions.

what exactually is a node?

head-->[Data]
|
node1-->[Data]
|
node2-->[Data]
|
node3-->[Data]
|
NULL

A node in a linked list usually contains a pointer to a data class/struct and a pointer to the next element in the list. If the data is as simple as ints, chars, floats, then you don't need a pointer to a data class/struct.

The node can be a class or a struct.

Here is my link.cpp file:

Code:

void Delrep(Struct Node* head)
{
	Node* current=head;
	if (current==NULL)            // Do nothing if is it empty
		return;              
	while (current->next!=NULL)   // compare current node with next node.
	{
		if(curent->data==current->next->data)
		{
			Node* nextNext = current->next->next;
			free(current-> next);
			current->next=nextNext;
		}
		else
		{
			current=current->next;    // advances if no deletion
		}
	}
}







void Inverse(Node** head)
{
	Struct Node* result=NULL;
	Struct Node* current= *head;
	Struct Node* next;

	while(current!=NULL)
	{
		next=current->next;              //note the next node
		current->next = result           //move the node onto the result
	    result=current;
		current=next;
	}
	*head= result;
}







void Printlinked(Node* head)
{
	Node*cursor;
	for(cursor=head;cursor !=NULL;cursor=cursor->link)
		cout <<cursor->data<<" ";

}

Hope u have a teacher beside u, I advice u choose a good program from a good book, write the program 1000 times in a paper . I bet u will have an impression on what is called C or C++.

good luck!

Thanks all, but I got the program to run good now!

Heres all my code:

# include "link.h"
# include <iostream.h>

Code:

void Delrep(Node* &head)
{
	Node* current=head,*next=head, *ptr;
	if (head!=NULL) // Do nothing if is it empty
		next=head->link;
	while(next!=NULL)
	{
		ptr=head;
		
	              
	while (ptr!=next&&ptr->data!=next->data) // compare current node with next
		ptr=ptr->link;
	
		if(ptr==next)
		{
			current->link=next;
			current=current->link;;
			next=next->link;    //advances if no deletion
		}
		else
		{
		    ptr=next->link; // advances if no deletion
			current->link=next->link;
			delete next;
			next=ptr;
		}
	}
}







void Invert(Node*&head)
{
	 Node* result,*present=head, *link;
	 result = NULL;
	

	while(present!=NULL)
	{
		link=present->link;              //note the next node
		present->link=result;          //move the node onto the result
	    result=present;
		present=link;
	}
	head= result;
}







void Printlinked(Node* &head)
{
	Node*cursor;
	for(cursor=head;cursor !=NULL;cursor=cursor->link)
		cout <<cursor->data<<" ";

}
# include "link.h"
# include <stddef.h>
# include < iostream.h>


void main()
{
	int x;
	Node* head;
	head = NULL;
	Node* ptr;
	
	cout<< "Please enter a list of integers,0 when done"<<endl;
	cin>>x;
	while(x!=0)
	{
    	ptr = new Node;            // Use to dynamically allocate a new node
		ptr->data=x;             // Set new node=x(input integer)
		ptr->link=head;
		head=ptr;
		cin>>x;
	}
	cout<<endl;
	cout<<"Here is your list of integers"<<endl;
	Printlinked(head);
	cout<< "Here is your list of integers in reverse"<<endl;
	Invert(head);
	Printlinked(head);
	cout<< "Here is your list of integers after duplicates have been deleted"<<endl;
	Delrep(head);
	Printlinked(head);
}

# include <stddef.h>
# include <iostream.h>

struct Node
{
	int data;    // to store information
	Node* link;  // Address to the next Node in a list
};



void Delrep(Node* &head);
void Invert(Node* &head);
void Printlinked(Node* &head);