one way linear link lists

[Acidburn]

[php]
#include

using namespace std;

typedef struct Template
{
int a;
Template * link; // goes forward (one way reference)

} list;

typedef list * listptr;

int main()
{
listptr head; // head is a type listptr
listptr p ;
listptr next ;

head = NULL; //therfore make it null
next = NULL;

for(int i =0 ; i<4 ; ++i)
{
p = new list;// create new element of p type of listptr (new structure)

cin >> p->a;

cout << p->a <link = next;
cout << p <

[Rashakil Fol]

Which way are you trying to build the list? Are you trying to have the most-recently entered element be at the front of the list, or are you trying to have the most-recently entered element be at the end of the list. Right now, it looks like you want the former, but since you appear very confused, I have to ask.

[Acidburn]

Which way are you trying to build the list? Are you trying to have the most-recently entered element be at the front of the list, or are you trying to have the most-recently entered element be at the end of the list. Right now, it looks like you want the former, but since you appear very confused, I have to ask.

hey dude, thanks for taking the time to read / reply. The most recent datat item is added to the end. In order to sort and use finding algos on the list there must be 2 pointers, whilst I've declared the 2 points to NULL I cant figure out how to use trailing pointers....

[akshatvig19]

[php] #include

using namespace std;

typedef struct Template { int a; Template * link; // goes forward (one way reference) } list;

typedef list * listptr;

int main() { listptr head; // head is a type listptr listptr p ; listptr next ;

head = NULL; //therfore make it null next = NULL;

for(int i =0 ; i<4 ; ++i) { p = new list;// create new element of p type of listptr (new structure) cin >> p->a;

cout << p->a <link = next; cout << p <

Hey dude i can give u the c code for that problem if u want but in C++ i have not clear funsdas///