I implemented stack using linkedlist without watching this video because Durgesh bhai already taught linked list so perfectly. So the only concept is that for stack push and pop opeation all we need is to use inserNodeAtEnd() and deleteNodeAtEnd(), basically we need to insert and delete from end only.
One mistake I would like to point out after doing more analysis in my approach is that the insertion should be done in stack using the insert note at beginning method because if we do using the insert note at end then the time complexity would become O(n) whereas the push operation of stack is O(1). So to match these two things I think we should be doing insertion at the beginning as it will also be O(1). Same is Case for deletion operation i.e we should be doing it at the beginning and not the end Thanks
![🔥 10 Common Mistakes Every Spring Boot Developer Must Avoid | Important for beginner [Hindi]](http://i.ytimg.com/vi/u6dD1FdKYNQ/mqdefault.jpg)
I implemented stack using linkedlist without watching this video because Durgesh bhai already taught linked list so perfectly. So the only concept is that for stack push and pop opeation all we need is to use inserNodeAtEnd() and deleteNodeAtEnd(), basically we need to insert and delete from end only.
One mistake I would like to point out after doing more analysis in my approach is that the insertion should be done in stack using the insert note at beginning method because if we do using the insert note at end then the time complexity would become O(n) whereas the push operation of stack is O(1). So to match these two things I think we should be doing insertion at the beginning as it will also be O(1). Same is Case for deletion operation i.e we should be doing it at the beginning and not the end
Thanks
Great Content Sir ❤
Sir stack overflow nhi hoga kya
Array wale implementation mai
Like comment share ❤
Ye series kab tak chalegi or dp graphs bhi hoga kya?
hona to chaiye
Hindi bolke yo to American english hai
Change the audio track