/* Trying to get to grips with linked lists, I know each node in a linked list */
/* contains data members and a pointer to the next node */
/* 1) In the following code I have two objects of type node my_node and */
/* my_next_node first I fill the array in the first node with some input */
/* then the pointer in this first node points to my second object of type node */
/* I don't really see any benefit here I could access both arrays through the */
/* objects of type node directly anyway my_node.word and my_next_node.word */
/* 1) I know i'm missing something here but what (maybe a brain) */
/* 2) how would I greate additional nodes and then delete them */
#include<stdio.h>
struct node{
char word[20];
node *ptr_to_next_node;
};
int main()
{
node my_node,my_next_node; /* Two objects of type node */
cin>>my_node.word; /* get input for first node */
ptr_to_next_node->my_next_node; /* first node pointer points to next node */
} /* note to myself INCOMPLETE CODE */
/* Thanks all for the help */