Given below are two statements: one is labelled as Assertion A and the other is labelled as
Reason R.
Assertion A: It is possible to create doubly linked list using only one pointer with every node.
Reason R: By storing the XOR of the addresses of the previous and next nodes. In the light of the above statements, choose the most appropriate answer from the options given below.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. Both A and R are true and R is the correct explanation of A
Explanation
An XOR linked list stores prev ⊕ next in one field; knowing one neighbour's address recovers the other. So a doubly linked list with one pointer per node is possible, and R explains how.
More Data Structures and Algorithms questions
- Given six weights 4, 15, 25, 5, 8, 16, construct a 2-tree (binary tree). What is the minimum weighted path length?
- Consider: A. The number of labelled binary trees possible with n nodes is (2n)!/(n + 1)!. B. The number of binary search trees possible wit…
- Which of the following are correct about Hamiltonian problems? A. The Hamiltonian cycle problem is NP-complete. B. If G is an undirected bi…
- For matrix multiplication with a simple divide-and-conquer algorithm: A. the running time is T(n) = Θ(n³) B. the running time is T(n) = Θ(n…
- Match List I with List II
- Match List I with List II