0 votes 0 votes Insertion of a node into a doubly linked list requires how many changes to various Next and Previous Pointer? A. No Change B. 1 Next , 1 Previous C. 2 Next , 2 Previous D. 3 Next , 3 Previous DS linked-list data-structures + – Arnab Bhadra asked Jun 28, 2017 Arnab Bhadra 3.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes Option C) 2 Next, 2 Previous Abhisek Das answered Jun 28, 2017 selected Jun 28, 2017 by Arnab Bhadra Abhisek Das comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments smsubham commented Oct 30, 2017 reply Follow Share What if we are inserting at beginning or end of LL? 0 votes 0 votes Yash4444 commented Apr 26, 2021 reply Follow Share suppose if we are inserting in beginning then we have to change next pointer of new node and make it point to first node and we also have to change previous pointer of first node and make it point to new node. same thing is when we insert in end. in this case we need to change 1 prev and 1 next. 0 votes 0 votes Yash4444 commented Apr 26, 2021 reply Follow Share here by default i am assuming as new node next and prev pointer are pointing to null initially when insertion is not done. 0 votes 0 votes Please log in or register to add a comment.