In queue using linked-list, during an insertion in to the queue? a) Only rear end changes b) only front end changes c) both changes d) no change for both
RE: In queue using linked-list, during an insertion in...
ANS : 'd' due to insertion in a linklist we may insert after the rear node or bfore the front node that's why there is no change in the rear or front so alsowe see int the linklist the first node(rear) is fixed. and the last node set to be null.
RE: In queue using linked-list, during an insertion in to the queue?a) Only rear end changesb) only front end changesc) both changesd) no change for both
The answer is "a" because Queue follow FIFO Data Structure.
Front---------A B C D E-----REAR
insertion will take place from REAR end..so result will be REAR.
