What is the space complexity for deleting a linked list?...

MCQ

What is the space complexity for deleting a linked list?

O(1)

O(n)

Either O(1) or O(n)

O(logn)

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

How are free blocks linked together mostly and in what addressing order?

circular linked list and increasing addressing order

linked list and decreasing addressing order

linked list and in no addressing order

none of the mentioned

Discussion

MCQ

What are the disadvantages in implementing buddy system algorithm for free lists ?

internal fragmentation

it takes so much space

we no more have the hole lists in order of memory address, so it is difficult to detect if 2 holes remain adjacent in memory and shall be merged into one hole

both a and c are correct

Discussion

MCQ

When new element is added in the middle of singly linked list then ________.

Only elements that appear after the new element need to be moved

Only elements that appear before the new element need to be moved

No need to move element

Only elements that appear after the new element and before need to be moved

Discussion

MCQ

Important concept related to lists is of

Location

Position

Arrays

Pointers

Discussion

MCQ

The following C function takes a simply-linked list as input argument. It modifies 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. Choose the correct alternative to replace the blank line.
typedef struct node
{
  int value;
  struct node *next;
}Node;

Node *move_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;
}

q = NULL; p->next = head; head = p;

q->next = NULL; head = p; p->next = head;

head = p; p->next = q; q->next = NULL;

q->next = NULL; p->next = head; head = p;

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