for inserting a node, it is possible to do without a counter rihgt? by just decrementing pos itself till it becomes 0 also, no need to track two nodes throughout iteration . You can just track and find prev node then stop the loop, and get the node after prev
Much appreciated! Finally found this on the third page of google results. It fills in the gaps of my understanding.
Hey buddy, keep on teaching stuffs coz few ppls like me are relying on you.... Good day pal
your explanations are so clear!!
Excellent explanation...
man you're a genius
for inserting a node, it is possible to do without a counter rihgt? by just decrementing pos itself till it becomes 0
also, no need to track two nodes throughout iteration . You can just track and find prev node then stop the loop, and get the node after prev
you explanations are so crystal clear and easy...Thank you buddy....can u create a playlist for complete data structure in python PLEASE??
u could save the vids he did on data structure in your own playlist :) llike what i did
for remove last and first node, its not right to decrement size for every case since if list is empty u dont decrement size further
it already returns None if the size is 0. so, the size is not decremented further
who else was confused by their teachers
No views
I'm single 😥😥😥😥😥
why