Linked Lists

[programmercarlito]

Ok so Im having trouble distinguishing why one set of code is different from the other if they both create a node
Here is the first code

struct Node* start = NULL;//initially no nodes so start is NULL aka Empty

start = new struct Node; //we made a new node
	start->info = 10;//we set info box to 10
	start->next = NULL;

Compared to this code

nodeType *head = NULL; // 1
	nodeType *current;

	

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

[Smac89]

They are not different:

nodeType *head = NULL; // 1
	

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

[programmercarlito]

Both Node and nodeType are structs but why doesnt nodeType have asterisk as oppose to Node.

[MikeyBoy]

What?

nodeType *head = NULL; // 1
nodeType *current;

Both have "asterisk" - i.e. both are declared as pointers.

Do you understand what the asterisk means? If not, then your first step really should be to go to your textbook and read up on it.

[programmercarlito]

What Im confused on is why is the top Node* as oppose to nodeType without having the pointer

[MikeyBoy]

Sorry, I don't understand what you mean.

In your top example, start is declared as a pointer to Node. The asterisk symbol specifies the type as a pointer.

In your second example, both head and current are declared as pointers to nodeType. In each of those declarations, the asterisk symbol specifies the type as a pointer.

[programmercarlito]

Thanks MikeBoy I get it now