ME01

#include<stdio.h>
#include<stdlib.h>
typedef struct node Node;
struct node{
 int data;
 Node* next;
};

void build_linked_list(Node **head_ptr)
{
  (*head_ptr)->next = NULL;
    Node* new_node = (Node*)malloc(sizeof(Node));
  int num;
    while(1)
    {
        scanf("%d",&num);
        if(num == -1)
        {
            break;
        }
        else
        {
            new_node->data = num;
                        new_node->next = *head_ptr;
                        *head_ptr = new_node;
        }
    }
}

int count(Node *head, int x)
{
  int count = 0;
  Node* current = head;
  while(current != NULL)
  {
    if(current->data == x) count++;
    current = current->next;
  }
  return count;
}

int get_nth(Node *head, int n)
{
  Node* current = head;
  int index = 1,result;
  while(current!= NULL)
  {
    if(index == n)
    {
      result = current->data;
      break;
    }
    current =  current->next;
    index++;
  }
  return result;
}