Recent questions tagged linked-list

Why the following code is not giving desired results? The code simple push & appends the nodes in the linked list.#include <stdio.h #include <stdlib.h struct Node{ int it...

we know that pointer implementation is not possible in java and dynamic memory allocation is also not possible.Then how we can implement linked list in java?

Which of the following is true about linked list implementation of queue?(a) In push operation, if new nodes are inserted at the beginning of linked list, then in pop ope...

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?(a) Deleting a node whose location in given(b) Searching ...

Linked Lists are not suitable for :Binary SearchPolynomial ManipulationInsertionRadix Sort

Given two statementsInsertion of an element should be done at the last node of the circular listDeletion of an element should be done at the last node of the circular lis...

In a doubly linked list the number of pointers affected for an insertion operation will be401Depends on the nodes of doubly linked list

struct node{ int num; struct node *next; } void print(struct node *ptr) { if(ptr) { printf("%d",ptr->data); do{ printf("%d",ptr->data); } while(ptr->next); } }What is the...

In a doubly linked list organization, insertion of a record in end involves modification of ____ for existing list.one pointertwo pointermultiple pointerno pointer

Express the following list in terms of a linked list structure suitable for internal representation.$(((ab)c)d((e)))$

A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue a...

Consider the following incomplete C function for reversing a singly linked list.node* reverse(node* trav){ if(trav->next) __________________ else { head - next = null; he...