Happy Codings - Programming Code Examples

C Programming Code Examples

C > Linked Lists Code Examples

Print Linked List In Reverse

Print Linked List In Reverse

#include <stdio.h>
#include <stdlib.h>

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

struct node *head = NULL;
struct node *current = NULL;

//display the list
void reverse_print(struct node *list) {
   if(list == NULL) {
      printf("[null] => ");
      return;
   }
   reverse_print(list->next);
   printf(" %d =>",list->data);
   
}

//Create Linked List
void insert(int data) {
   // Allocate memory for new node;
   struct node *link = (struct node*) malloc(sizeof(struct node));

   link->data = data;
   link->next = NULL;

   // If head is empty, create new list
   if(head==NULL) {
      head = link;
      return;
   }

   current = head;
   
   // move to the end of the list
   while(current->next!=NULL)
      current = current->next;
   
   // Insert link at the end of the list
   current->next = link; 
}

int main() {
   insert(10);
   insert(24);
   insert(36);
   insert(1);
   insert(44);
   insert(56); 

   reverse_print(head);
   return 0;
}

Perform Input Output all Basic Data Types - C language program demonstrate input and output of all basic and derived types. How to use scanf() & printf() function perform input and output on primitive types in C language.

Insertion Sort Algorithm in C++ Language - Insertion sort is simple sorting algorithm that builds the final sorted array ('or list') one item at a time. It is much less efficient on large lists than more advanced algorithms such as quick

Code fscanf Works Exactly Like the scanf() - C Programming fscanf: works exactly like the scanf() function except that it reads from the stream. Returns the number of arguments actually assigned values or EOF on failure &

C++ Language Implementation For Queue - Return the least recently inserted item in the queue or throw "Underflow" if empty. Return and remove the least "recently inserted" item from the queue. "Throw Underflow" if empty.

Program to Check Whether Graph is DAG - This is a C++ Program code to check whether graph is DAG. In mathematics and computer science, a directed acyclic graph, is a directed graph with no directed cycles. It is formed by

Using Binary Search Technique & Displays - To perform "Binary Search" in 'C++', enter the array size, enter the array elements. Now ask to enter an element that is going to be search to "start searching" that element using binary

Code shows how to fork system call works - C Programming example that shows how fork system call works. Let us now print the current working directory of the child. Now we are in the parent thread. Let is check the

C++ Implement Circular Singly Linked List - Enter the element and "Insert element" after position. Print: "list is empty" and nothing to delete. Enter the element for deletion. Enter the element to be searched. "Create Circular"