Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
Insert and delete both can be the answers ? since from the head only we have to traverse whole LL
@hg11110000 hey it depend on consition of insertion and deletion,suppose apko head ya last pr insert delete krana hai then it will be in constant work but agr apko beech me khi insert ya delete krani hai node to apko linked list ko traverse krke waha tk phunchna pdega ,which depend on length of linked list.
yeah that’s what but the answer for this shows delete element from the last ???
@hg11110000 hey actually yes ,this is true kyunki apko last pointer dia hai delete ke lie usse pehle wali node ka next Null bhi krna hai apko ,islie apko second last node tk jana pdega traverse krke ,thats why woh keh rha hai ki length pr depend kregi.