• recategorized by
746 views

1 Answer

2 2 votes

It deletes the node P from the linked list.

Reason:

We are updating the references for the nodes to the left and right of node P. Hence, the right pointer of the node to the left of P will point to the node to the right of P. Also the left pointer of node to the right of P will point to the node to the left of P. Once, these operations are done, we can no longer access node P. 

 

Position:
Show:

Related questions

4 4 votes
3 3 answers
4.6k
4.6k views
Hirak asked Jun 9, 2019
4,595 views
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, ...
0 0 votes
1 1 answer
4.6k
4.6k views
Sumit Singh Chauhan asked Aug 18, 2018
4,559 views
What is time complexity of fun()?int fun(int n){ int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count;}(A) O(n^...
0 0 votes
1 1 answer
3.9k
3.9k views
Pankaj Joshi asked Jan 14, 2017
3,910 views
Which of the following statements is correct about context sensitive grammar?I) In a context sensitive grammar, ε can’t be the right hand side of any productionII) In a c...
0 0 votes
2 2 answers
784
784 views
Sarvottam Patel asked Jan 13, 2017
784 views
A and B are two sets. If |A| = 5 , |B| = 3 , then, the number of onto functions from A to B are ___ ?(A) 35(B) 150(C) 29(D) 27