Complexity of the linkedlist

#21

ohhh yes it do not have you can use insert after in it it is in the link i provided you

#22

there are do many stl like list - vector forward list queue deque … you can google and learn about them .

#23

hope there wont be any other doubts so you can mark it as resolved now @Vikaspal :smiley:

#24

@vatsal38 insert after will works ?

#25

yes its in the link @Vikaspal

#26

is it ok ? will you be able to do it?

#27

@vatsal38 sorry for asking to many question . but i am confused although i read the article but not able to understand the two like of code
forward_list< int >::iterator ptr; here what does :: iterator ptr why?
ptr = flist.insert_after(flist.begin(), {1, 2, 3}); and the args ?
what i have to insert the one elements ?

#28

it all comes under iterator you have to study it first otherwise wont be able to explain. you can simple use vector or list it supports push back. best choice would be vector @Vikaspal

#29

its ok i know that you are confused just take it one at a time focus on list and vector dont use forward list because all its functions can be implemented with vector or list easily. i also never used forward list came to know about it by you only😃

#30

@vatsal38 yes the list is like the doubly LL to have to take care of the both the pointer prev and next one

#31

yes @Vikaspal you are right

#32

so any more doubt s @Vikaspal?
if not mark the doubt as resolved

#33

@vatsal38 send me the links

#34

just write the name of stl which you want functions of and gfg afterwards like
list stl gfg
vector stl gfg …
@Vikaspal

#35

@vatsal38 i mean the thread link to marks the doubt as resolved

#36

go to my doubts section in your portal there you will see the option @Vikaspal