Register
Dark Mode

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 3

in DS recategorized by
349 views
6 votes
6 votes

What is the run-time complexity of inserting a new element at the beginning of a circular, doubly-linked list with a head?

  1. $O(1)$
  2. $O(\log \text{N})$
  3. $O(\text{N})$
  4. $O(\text{N}^2)$
in DS recategorized by
by
349 views

2 Answers

12 votes
12 votes

This can be done in constant Time

by
1 vote
1 vote
O(1)

We need to change only the links. No need to traverse the linked list hence no loops.
by
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Developed by Chun
Link Copied!