Aspire Faculty ID #12796 · Topic: JECA MCA 2023 · Just now
JECA MCA 2023

41.In singly linked list, the time complexity for insertion at a particular node is:

Solution

  • Insertion after a given node in a linked list takes constant time O(1) (if pointer to that node is already available).


Previous 10 Questions — JECA MCA 2023

Nearest first

Next 10 Questions — JECA MCA 2023

Ascending by ID
Ask Your Question or Put Your Review.

loading...