2 votes 2 votes In a doubly linked list organization, insertion of a record in end involves modification of ____ for existing list. one pointer two pointer multiple pointer no pointer DS linked-list + – srestha asked Jan 4, 2017 srestha 3.9k views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Gate Mission 1 commented Jan 4, 2017 reply Follow Share Answer is correct --> 1 Here question ask modification in existence link only which will be the last link -> right pointer updated to point new last link, though we also modify new last link -> left to point to original last link [which is now second last]. 1 votes 1 votes srestha commented Jan 4, 2017 reply Follow Share what it was previously? last_link -> right =NULL; right? Now, new_last_link -> left= last_link -> right; new_last_link ->right =NULL; right? 0 votes 0 votes Gate Mission 1 commented Jan 4, 2017 reply Follow Share Small edit. @shreya new_last_link -> left = last_link; [ not last_link -> right ] last_link -> right = new_last_link; 0 votes 0 votes Please log in or register to add a comment.
4 votes 4 votes I think modification of only 2 pointers is need . 1. Make it the last link 2. Make pointer to the previous node. Abhijit Borah answered Jan 8, 2017 Abhijit Borah comment Share Follow See 1 comment See all 1 1 comment reply Ankit001 commented Jul 14, 2017 reply Follow Share ans: 1 pointer Because in qus it is written that modification of existing list not the new node(not total modification if they ask total then ans will be 2 pointer). In existing list we are modifying only last node next value. 0 votes 0 votes Please log in or register to add a comment.