Question

resuming a number of nodes greater than 2 in a linked list which of the following code will delete the two nodes from linked list​

Answer 1

Begin at the top of the queue, 'a,' and count the first M nodes of the linked list with a tally variable, capturing 2 elements here: Month minimum page -> 'b,' and (M+1) th node -> 'c.'

• Count the following Tuples one by one from (M+1)th node and extract the (N+1)th node reference, which is 'e'.
• Make the next field of the Mth given to the (N+1)th node now. Do the same for the entire list in a recursive manner. If the targeted node is at the top, set start to equal start->next and remove the temp node.
• If it's in the middle, pause another node just before temp and make the next of that node similar to temp's future, then eliminate it.

Answer 2

Answer:

LINK[X]:=LINK[LINK[LINK[X]]]

Explanation:

How do you rely nodes in a related listing?

countNodes() will rely the nodes gift withinside the listing:

Define a node cutting-edge so one can first of all factor to the top of the listing.

Declare and initialize a variable rely to 0.

Traverse via the listing until cutting-edge factor to null.

Increment the fee of rely via way of means of 1 for every node encountered withinside the listing.

Below are steps to discover the primary node of the loop.

If a loop is found, initialize a sluggish pointer to head, allow rapid pointer be at its position.

Move each sluggish and rapid suggestions one node at a time.

The factor at which they meet is the begin of the loop.

#spj2