Which of the following is false about a circular linked list...

MCQ

Which of the following is false about a circular linked list?

Every node has a successor

Time complexity of inserting a new node at the head of the list is O(1)

Time complexity for deleting the last node is O(n)

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider the following linked list representation. Which of the following statement is used to create a node ?

struct node {
      int data;
      struct node *next;
}start = NULL;
struct node *new_node;

new_node=(struct node *)malloc((struct node));

new_node=(struct *)malloc(sizeof(struct node));

new_node=(struct node)malloc(sizeof(struct node));

new_node=(struct node *)malloc(sizeof(struct node));

Discussion

MCQ

Disadvantages of linked list representation of binary trees over arrays?

Randomly accessing is not possible

Extra memory for a pointer is needed with every element in the list

Difficulty in deletion

Random access is not possible and extra memory with every element

Discussion

MCQ

Which of the following application makes use of a circular linked list?

Undo operation in a text editor

Recursive function calls

Allocating CPU to resources

All of the mentioned

Discussion

MCQ

The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list could be used ?

Array Implementation of List

Singly Linked List

Circular Doubly Linked List

Doubly Linked List

Discussion

MCQ

What would be the asymptotic time complexity to find an element in the linked list?

O(1)

O(n)

O(n^2)

None of the mentioned

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics