Interview Questions And Answers 
-
Delete an element from a doubly linked list.
2,098 Views |
(2 votes, avg: 4)
Loading ...
Answers »
Our Sponsors
Our Sponsors
Delete an element from a doubly linked list.
2,098 Views | (2 votes, avg: 4)
Loading ...
void deleteNode(node *n)
{
n->previous=n->next;
delete n;
}
void deleteNode(node *n)
{
node *np = n->prev;
node *nn = n->next;
np->next = n->next;
nn->prev = n->prev;
delete n;
}
del(Node* n)
{
(n->prev)->next = n->next;
delete (n);
}
The 1st and 3rd solutions are incomplete as they only reset one of the 2 pointers associated with each node.
soln 2 is complete
void del(node *n)
{
(n->prev)->next = n->next;
(n->next)->prev = n->prev;
delete (n);
}
bitch
small correction to asdf solution
void del(node *n)
{
if (!n) return;
if (n->prev) n->prev->next = n->next;
if (n->next) n->next->prev = n->prev;
delete (n);
}
void del(node *n)
{
if (!n) return;
if (n->prev) n->prev->next = n->next;
else if (n->next) n->next->prev = NULL;
if (n->next) n->next->prev = n->prev;
else if (n->prev) n->prev->next = NULL;
delete (n);
}
Leave an Answer/Comment