fork download 
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. typedef struct Node {
  5.     int data;
  6.     struct Node* prev;
  7.     struct Node* next;
  8. } Node;
  9.  
  10. Node* head = NULL;
  11.  
  12. Node* create_node(int data) {
  13.     Node* new_node = (Node*)malloc(sizeof(Node));
  14.     new_node->data = data;
  15.     new_node->prev = new_node->next = NULL;
  16.     return new_node;
  17. }
  18.  
  19. void insert(int data) {
  20.     Node* new_node = create_node(data);
  21.     if (!head) {
  22.         head = new_node;
  23.         return;
  24.     }
  25.     Node* curr = head;
  26.     while (curr->next) curr = curr->next;
  27.     curr->next = new_node;
  28.     new_node->prev = curr;
  29. }
  30.  
  31. void delete_node(int data) {
  32.     Node* curr = head;
  33.     while (curr) {
  34.         if (curr->data == data) {
  35.             if (curr->prev) curr->prev->next = curr->next;
  36.             if (curr->next) curr->next->prev = curr->prev;
  37.             if (curr == head) head = curr->next;
  38.             free(curr);
  39.             return;
  40.         }
  41.         curr = curr->next;
  42.     }
  43. }
  44.  
  45. void print_list() {
  46.     Node* curr = head;
  47.     printf("Linked List: ");
  48.     while (curr) {
  49.         printf("%d ", curr->data);
  50.         curr = curr->next;
  51.     }
  52.     printf("\n");
  53. }
  54.  
  55. int get_length() {
  56.     int count = 0;
  57.     Node* curr = head;
  58.     while (curr) {
  59.         count++;
  60.         curr = curr->next;
  61.     }
  62.     return count;
  63. }
  64.  
  65. void delete_middle() {
  66.     int length = get_length();
  67.     if (length == 0) return;
  68.     int mid = length / 2;
  69.     Node* curr = head;
  70.     for (int i = 0; i < mid; i++) curr = curr->next;
  71.     delete_node(curr->data);
  72. }
  73.  
  74. void exchange_first_last() {
  75.     if (!head || !head->next) return;
  76.     Node* first = head;
  77.     Node* last = head;
  78.     while (last->next) last = last->next;
  79.     int temp = first->data;
  80.     first->data = last->data;
  81.     last->data = temp;
  82.     print_list();
  83. }
  84.  
  85. void search(int value) {
  86.     Node* curr = head;
  87.     int pos = 0;
  88.     printf("Positions of %d: ", value);
  89.     while (curr) {
  90.         if (curr->data == value) printf("%d ", pos);
  91.         curr = curr->next;
  92.         pos++;
  93.     }
  94.     printf("\n");
  95. }
  96.  
  97. void find_min() {
  98.     if (!head) return;
  99.     int min = head->data;
  100.     Node* curr = head->next;
  101.     while (curr) {
  102.         if (curr->data < min) min = curr->data;
  103.         curr = curr->next;
  104.     }
  105.     printf("Smallest value: %d\n", min);
  106. }
  107.  
  108. int main() {
  109.     insert(5);
  110.     insert(3);
  111.     insert(9);
  112.     insert(1);
  113.     insert(3);
  114.     print_list();
  115.  
  116.     printf("Length: %d\n", get_length());
  117.     delete_middle();
  118.     print_list();
  119.     exchange_first_last();
  120.     search(3);
  121.     find_min();
  122.  
  123.     return 0;
  124. }
  125.  
Success #stdin #stdout 0s 5288KB
comments ()
stdin 
Standard input is empty
stdout 
Linked List: 5 3 9 1 3 
Length: 5
Linked List: 5 3 1 3 
Linked List: 3 3 1 5 
Positions of 3: 0 1 
Smallest value: 1
https://ideone.com/Rbt0CQ
language:
C (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!