0% found this document useful (0 votes)
9 views1 page

Implementing Circular Doubly Linked List

This document describes a circular doubly linked list and shows a figure demonstrating inserting a new node before the first node. It asks to write a function called insert that takes a circular linked list and an integer as parameters and inserts the integer as a new node into the list before the first node.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views1 page

Implementing Circular Doubly Linked List

This document describes a circular doubly linked list and shows a figure demonstrating inserting a new node before the first node. It asks to write a function called insert that takes a circular linked list and an integer as parameters and inserts the integer as a new node into the list before the first node.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Sample Question

Question 1. Consider the following doubly linked list.

Figure 1 Insertion in Circular Linked List

The figure 1 demonstrates an insert operation in the circular linked list. The newly created node is
inserted just before the first node (indicated by the start *).

Write a function insert (List *s, int insert) that inserts the given element in the circular linked list.

You might also like