The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+2 votes
672 views

In circular singly linked list, insertion of node requires modification of how many pointers?

  1. 1 pointers
  2. 2 pointers
  3. 3 pointers 
  4. 4 pointers
asked in Programming by Active (2.7k points)
edited by | 672 views
+2

it will require modification of 2 pointers viz. next of node N1 after which insertion is to be done and next of new node.

0
circular singly linked list or doubly.

In Singly: 2 pointers in middle, 1 in end

In Doubly: 4 pointers in middle , 2 in end

1 Answer

+2 votes
Best answer

for circular singly linked list,

answered by Boss (12.9k points)
selected by
0
other than these pointers did we need to consider the modification in the head pointer also @thakur sir
+1

yes we consider for insertion at end of CSLL.

see this: http://www.geeksforgeeks.org/circular-singly-linked-list-insertion/



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

39,585 questions
46,709 answers
140,143 comments
57,879 users