Recent questions tagged linked-list

In circular linked list, insertion of a node at the end involves pointer modification:(A) one(B) two(C) three(D) none

The minimum number of fields with each node of doubly linked list is1234

The following C function takes a singly-linked list of integers as a parameter and rearranges the elements of the list. The list is represented as pointer to a structure....

Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to del...

Consider the following statements:First-in-first out types of computations are efficiently supported by STACKS.Implementing LISTS on linked lists is more efficient than i...

Which of the following statements is true?As the number of entries in a hash table increases, the number of collisions increases.Recursive programs are efficientThe worst...

Linked lists are not suitable data structures for which one of the following problems?Insertion sortBinary searchRadix sortPolynomial manipulation

The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified l...

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^{\text{th}}$ node $(1 \...

Consider the following piece of 'C' code fragment that removes duplicates from an ordered list of integers.Node *remove-duplicates (Node* head, int *j) { Node *t1, *t2; ...

The concatenation of two lists is to be performed on $O(1)$ time. Which of the following implementations of a list should be used?Singly linked listDoubly linked listCirc...

Let $p$ be a pointer as shown in the figure in a single linked list. What do the following assignment state...

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ wil...

A circularly linked list is used to represent a Queue. A single variable $p$ is used to access the Queue. To which node should $p$ point such that both the operations $\t...

Consider the function $f$ defined below.struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL) || (p->next == NULL)|| ((p->data <= p -...

In the worst case, the number of comparisons needed to search a single linked list of length $n$ for a given element is$\log n$$\frac{n}{2}$$\log_2 {n} - 1$$n$

The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing th...