izpiti-1-2.c

// izpiti komplet 1/5 - naloga 2.

#include <stdio.h>
#include <stdlib.h>
#define ST_ELEMENTOV 10

typedef struct node {
  int value;
  struct node *next;
} node;

node* addItem(node *, int);
node* revertList(node *);

int main(int argc, char const *argv[])
{
  // node *list = (node *) malloc(sizeof(node));
  // list->value = 0;
  node *list = NULL, *first = NULL;

  for(int i = 2; i <= ST_ELEMENTOV; i++) {
    list = addItem(list, i);
    if(i == 1)
      first = list;
  }

  node *next = first;

  while (next != NULL) {
    printf("list val: %d | next val: \n", list->value);
    if(list->next != NULL)
      printf("%d\n", list->next->value);
    else
      printf("NULL\n");
    next = next->next;
  }

  // revertList(list);

  free(list);
  return 0;
}

node* addItem(node *list, int value) {
  if(list == NULL) {
    list = (node *) malloc(sizeof(node));
    list->value = value;
    list->next = NULL;
    return list;
  }
  else
    list = addItem(list->next, value);
  return list;
}

node* revertList(node *list) {
  node *next = NULL;

  while((next = list->next) != NULL)
    printf("%d\n", next->value);

  free(next);
  return NULL;
}