CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Byju's Answer
Other
Other
CLL-Introduction
A variant of ...
Question

A variant of linked list in which last node of the list points to the first node of the list is?

A
Multiply linked list
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
Circular linked list
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
Singly linked list
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
Doubly linked list
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is B Circular linked list
Circular linked list

flag
Suggest Corrections
thumbs-up
0
similar_icon
Similar questions
Q. Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best-known algorithm to delete the node x form the list?
Q. The following C function takes a singly-linked list as input argument. It modified by the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank.

typed of struct node
{
int value;
struct node * next;
} Node;
Node *mode_to_ front(Node *head)
{
Node *p, *q;
if((head == NULL)∥(head → next == NULL))
return head;
q = NULL;
p = head;
while (p→next != NULL)
{
q = p;
p = p→ next;
}
______________________
return head;
}

Choose the correct alternative to replace the blank line.
Q. What is the worst case time complexity of inserting a node in a doubly linked list?
Q. Which of the following is a type of the linked list, in which there is no node containing a NULL pointer?
Q. The following C function takes a singly-linked list of integers as a parameter and rearranges the elements of the list. The list is represented as pointer to a structure. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order.

What will be the contents of the list after the function completes execution?

struct node
{
int value;
struct node *next;
};
void rearrange (struct node *list)
{
struct node *p, *q;
int temp;
if (!list ∣ ∣ !list → next)
return;
p = list;
q = list → next;
while (q)
{
temp = p → value;
p → value = q → value;
q → value = temp;
p = q→ next;
q = p ? p → next : 0;
}
}



View More
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
CLL-Introduction
OTHER
Watch in App
explore_more_icon
Explore more
CLL-Introduction
Other Other
Join BYJU'S Learning Program
book_image
Solve
book_image
Textbooks
book_image
Question Papers
book_image
Install app
CrossIcon