DSA (Binary tree)
Linked List Program Linked List Program in C //For better view open in laptop #include <stdio.h> #include <stdlib.h> // Definition of the node structure struct node { int info; // Data to store struct node *link; // Pointer to the next node }; // Function to create a new node struct node *createnode(int x) { struct node *new_node = (struct node *) malloc(sizeof(struct node)); if (new_node == NULL) { printf("Memory allocation failed\\n"); exit(1); } new_node->info = x; new_node->link = NULL; return new_node; } // Function to insert a node at the beginning of the list struct node *insert_beg(struct node *first, int x) { struct node *new_node = createnode(x); new_node->link = first; return new_node; } // Function to insert a node at the end of the list struct node *insert_end(struct node *first, int x) { struct node *new_node = createnode(x); ...
