Question

Write a program to demonstrate doubly linked list using pointers – insert (beginning, end,

Answer 1

A program to demonstrate doubly linked list using pointers – insert (beginning, end, middle), delete(beginning, end, middle),view) is:

/* Initialize nodes */

struct node *head;

struct node *one = NULL;

struct node *two = NULL;

struct node *three = NULL;

/* Allocate memory */

one = malloc(sizeof(struct node));

two = malloc(sizeof(struct node));

three = malloc(sizeof(struct node));

/* Assign data values */

one->data = 1;

two->data = 2;

three->data = 3;

/* Connect nodes */

one->next = two;

one->prev = NULL;

two->next = three;

two->prev = one;

three->next = NULL;

three->prev = two;

/* Save address of first node in head */

head = one;

What is a Doubly Linked List?

This refers to the linked data structure that contains of a set of sequentially linked records called nodes.

The requested program is given above.

Read more about doubly linked list here:

brainly.com/question/13326183

#SPJ1