In pointer implementation of linked lists, assuming only the head pointer is…

Bihar STET · PGT (Paper 2) · Computer Science · 2025

In pointer implementation of linked lists, assuming only the head pointer is available, which operation can be performed in constant time O(1) when inserting or deleting nodes?

  1. A.

    Inserting at the beginning

  2. B.

    Inserting at the end

  3. C.

    Inserting at a specific position

  4. D.

    Deleting a specific node

Attempted by 1003 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Explore the full course: Bihar Stet Paper Ii Computer Science

Loading lesson…