Skip to content

Instantly share code, notes, and snippets.

@jitsceait
Created November 29, 2015 12:33
Show Gist options
  • Save jitsceait/1bbebd28a5de352a34d3 to your computer and use it in GitHub Desktop.
Save jitsceait/1bbebd28a5de352a34d3 to your computer and use it in GitHub Desktop.
#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
int data;
struct Node * next;
} Node;
Node * createNode(int val){
Node * temp = (Node *)malloc(sizeof(Node));
if(temp){
temp->data = val;
temp->next = NULL;
}
return temp;
}
/* This function inserts node at the head of linked list */
void push(Node **headRef, int data){
Node * newNode = createNode(data);
newNode->next = *headRef;
*headRef = newNode;
}
void printList(Node *head){
while(head){
printf("%d->", head->data);
head = head->next;
}
printf("Null");
}
/* Function to find middle node using traversing twice */
Node * findMiddleNode(Node * head){
if(!head) return NULL;
Node *current = head;
int counter = 0;
while(current){
counter++;
current = current->next;
}
// Find half of number of nodes of list
int middle = counter/2;
//re-initialise variables.
counter = 0;
current = head;
while(counter < middle){
counter++;
current = current->next;
}
return current;
}
int main(void) {
Node * head = NULL;
push(&head, 3);
push(&head, 4);
Node * nodeToDelete = head;
push(&head, 5);
push(&head, 6);
push(&head, 7);
push(&head, 8);
push(&head, 9);
printf("\nOriginal list :");
printList(head);
Node *mid = findMiddleNode(head);
printf("\nMiddle node : %d", mid ? mid->data : 0);
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment