Can you use doubly linked list as a circular linked?

Answer 1

Write a program that inputs a series of integers and passes them one at a time to a function even which uses the remainder operator to determine if an integer is even. The function should take an integer argument and return 1 if the integer is even and 0 otherwise.

Answer 2

to create a linked list at first we need to design the structure of node i.e. what kind of data it is having. after creating node we will make a start node.

e.g.

struct node

{

int info;

struct node * next;

}

node *start,*y,*z;

void main()

{

x=malloc(sizeof(struct node));

printf("enter the data");

scanf("%d",&x->info);

start=y=x;

while(x->info!=0) // termination condition

{

x=malloc(sizeof(struct node));

printf("enter the data");

scanf("%d",&x->info);

y->next=x;

y=x;

}

x->next=NULL; // end node

}

Answer 3

First, you need to decide whether you want a singly-linked list or a doubly-linked list.

The advantage of a doubly-linked list is that you can traverse it forwards or backwards, and it's easier to remove the tail element.

Then, you need to define a structure for the nodes:

Singly-linked version:

struct node {

struct node *next;

void *data;

};

typedef struct node node;

Doubly linked version:

struct node {

struct node *next;

struct node *previous;

void *data;

};

typedef struct node node;

You need to dynamically allocate nodes using malloc, because you don't know how many there are going to be.

You need to write a function that has a declaration something like this:

node *node_create(void *data);

You need to keep track of one node in the list, which is the head (and tail), so for this and other reasons it's a good idea to make the list itself a structure:

typedef struct {

node *head;

} circularlist;

And you'll need functions to create the list using malloc and delete it using free:

circularlist *circularlist_create(void);

void circularlist_delete(circularlist *list);

Once you've done that, you need to write the functions to add data.

Which functions you want is up to you, but these are some possibilities:

void circularlist_add_head(circularlist *list, void *data);

void circularlist_add_tail(circularlist *list, void *data);

void circularlist_add(circularlist *list, void *data, node *predecessor);

The fun part is implementing these functions to create nodes and link them together.

When you want to iterate over the list, you need to do something like this:

node = list->head;

do {

printf("%s\n", (const char*)node->data);

node = node->next;

} while (node != list->head);

Make sure you delete all of the nodes when you delete the list.

Be aware that when you have deleted a node, its next pointer is no longer valid, so you may need to use a temporary variable.

Answer 4

A linked list is a list of data that is in an unordered sequence. Each piece of data contains the location of the next piece of data in an ordered (sorted) sequence.

The last piece of data in the ordered (sorted) sequence has the location of the next piece of data set to the very first piece of data (in the ordered (sorted) sequence). This makes the list circular because the is no physical end just a logical end.

A circular linked list is searched by first picking on any particular data set and inspecting it for desired match. If the match is not found then the data set is read using the location of the current data set. If the desired match is not found, eventually the location of the next data set will be the very first data set that was inspected indicating that the search has performed a full circle and the desired match does not exist.

Answer 5

To create a linked list you need to create a class/structure and assign it a pointer to another instance of same class/structure.

For example:

typedef struct list

{

struct list *next;

int a;

} list;

Here the next pointer in the structure will refer to the next element in the list.

Answer 6

Yes, if there is no first and last element, but the elements for a (bi-directional) cícle.