Nodes in Linked Lists

[programmercarlito]

So I created a bunch of nodes and I made each one before one another. Im having trouble adding another node to the last one.

 
#include <iostream>
using namespace std;

struct nodeType{
	int info;
	nodeType *link;
};

void printList(nodeType *head)
{
	nodeType *current = head;

	if (head == NULL)
	{
		cout << "Empty list\n";
	}
	else{

		while (current != NULL)
		{
			cout << current->info << "  ";
			current = current->link;
		}
		cout << endl;
	}
}
int main()
{
	nodeType *head = NULL; // 1
	nodeType *current;

	printList(head);

	// 2: insert number 100 to  as first node
	current = new nodeType;
	current->info = 100;
	current->link = NULL;
	head = current;
	printList(head);

	// 3: insert number 200 before number 100
	current = new nodeType;
	current->info = 200;
	current->link = head;
	head = current;


	// 4: print link list from the beginning 
	//print the link list
	//-------------------------
	printList(head);
	
	current = new nodeType;
	current->info=300;
	current->link = head;
	head = current;
	
	printList(head);
	
	current = new nodeType;
	current->info=400;
	current->link = NULL;
	head = current;
	
    printList(head);
	system("pause");
	return 0;
}

The node with the value of 400 is the node that has to be last.. How would that work?

[coder777]

I suggest that you make functions like push_front and push_back.

push_front is what are you doing now (insert at head).

push_back is similar to printList, but you need to add the node to current->link and if (head == NULL) -> like the first node (100)

Make sure that the link member of nodeType is always set to nullptr in the first place. The easiest would be a constructor for nodeType

[programmercarlito]

Can you show me an example please? Thanks

[Pavuluri]

Hi Forum, It is very nice discussion about the linked list
for more information refer http://www.cpptutorials.com/2015/01/reversing-linked-list-in-cc-with.html