Bissoy.com
Doctors Medicines MCQs Q&A

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list?

Given pointer to a node X in a singly linked list. Only one pointer is given, pointer to head node is not given, can we delete the node X from given linked list? Correct Answer Possible if X is not last node

Following are simple steps. struct node *temp = X->next; X->data = temp->data; X->next = temp->next; free(temp);

Related Questions

A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue be implemented by inserting a new node at the head, and dequeue be implemented by deletion of a node from the tail. Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?
Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
N items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations on the list in this order: Θ(N) delete, O(log N) insert, O(log N) find, and Θ(N) decrease-key. What is the time complexity of all these operations put together?
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. These are called twins of each other. A twin pointer is a pointer from an adjacency list entry to its twin. If |E| = m and |V| = n, and the memory size is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?
A doubly linked list is declared as struct Node{                 int Value;                 struct Note*fwd;                 struct Node * Bwd; } Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly liked list, if it is assumed that X points to neither the first nor the last node of the list?
Two centrifugal pumps P and R are available for use in a pipe flow system and their head-discharge characteristics are as follows. Pump P Pump R Discharge (cumecs) Head (m) Discharge (cumecs) Head (m) 0 40 0 45 0.12 35 0.14 40 0.2 28 0.24 35 0.3 18 0.3 28   The following statements (S1, S2, and S3) pertain to the head and discharge values during actual operation. Neglect losses in the system. Which of the following statements are correct? S1: When the two pumps P and R are connected in parallel, the discharge is 0.36 cumecs corresponding to a head of 35 m. S2: When the two pumps P and R are connected in parallel, the discharge is 0.36 cumecs corresponding to a head of 70 m. S3: When the two pumps P and R are connected in series, the discharge is 0.3 cumecs corresponding to a head of 46 m.
Which of the following statements are not correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?