ITERATIVE SOLUTION-

 /*
 * File:   main.cpp
 * Author: akash
 *
 * Created on 12 August, 2015, 4:57 PM
 */
#include <stdio.h>
 #include <stdlib.h>
struct node
 {
 int data;
 struct node* next;
 };
 //void push(struct **node top_head,int dataToEnter);
 //int getCount(struct *node top_head);
void push(struct node** top_head,int dataToEnter)
 {
 struct node* add_node = (struct node*) malloc(sizeof(struct node));
add_node->data = dataToEnter;
 add_node->next = (*top_head);
 (*top_head) = add_node;
 }
int getCount(struct node* top_head){
 if (top_head == NULL)
 return 0;
// count is 1 + count of remaining list
 return 1 + getCount(top_head->next);
 }
int main(){
 struct node* head = NULL;
push(&head, 10);
 push(&head, 20);
 push(&head, 30);
 push(&head, 40);
 push(&head, 20);
 push(&head, 30);
printf("Nodes Count is %d", getCount(head));
 return 0;
 }