/*
 * linkedList.c
 *
 *  Created on: Mar 17, 2014
 *      Author: carola
 */



#include<stdio.h> // printf
#include<stdlib.h> // malloc

struct list_node {
  int data;
  struct list_node* next;
};


int main(){
  int i=0;

  //printf("&i=%d\n", &i);
  printf("&i=%u\n", (unsigned) &i);
  int A[5]={2,4,6,8,10};

  printf("&A[0]=%u\n", (unsigned) &A[0]);
  printf("&A[4]=%u\n", (unsigned) &A[4]);


  struct list_node front;
  printf("&front=%u\n", (unsigned) &front);
  printf("&front.data=%u\n", (unsigned) &front.data);
  printf("&front.next=%u\n", (unsigned) &front.next);

  front.data = 1;
  front.next = malloc(sizeof(struct list_node));
  printf("front.next=%u\n", (unsigned) front.next);

  //(*(front.next)).data=2;
  front.next->data=2;
  printf("front.next->data=%d\n", front.next->data);
  front.next->next = malloc(sizeof(struct list_node));
  printf("front.next->next=%u\n", (unsigned) front.next->next);
  front.next->next->data=3;
  front.next->next->next = NULL;


  return 0;
}