The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+7 votes
558 views
Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{th}$ node $(1 \leq j \leq n)$ in which $d_j$ is stored. A new data item $d$ stored in node with address $Y$ is to be inserted. Give an algorithm to insert $d$ into the list to obtain a list having items $d_1, d_2, \dots, d_{j}, d,\dots, d_n$ in order without using the header.
asked in DS by Veteran (59.5k points)
recategorized by | 558 views

2 Answers

+17 votes
Best answer

Following $2$ lines are enough to realise above constraint :->>

1. Y->next = X-> next

2. X->next = Y

answered by Boss (22.8k points)
edited by
+1

d->next = dj->next

dj->next = d

+7 votes

these steps are mandatory for the algorithm :
$\begin{align*} temp &= X \rightarrow next\\ X \rightarrow next &= Y \\ Y \rightarrow next &= temp \end{align*}$

answered by Boss (30.8k points)
0
why are you using an extra temp ?

simply   y->next=x->next;

x->next=y;


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,751 questions
46,765 answers
140,657 comments
58,518 users