Stacks (Program 1) – Part 2

Data Structures: Stacks (Program 1) – Part 2
Topics discussed:
1) Writing a C program to implement a stack in an array stack_arr[ ] using stack_arr[0] as the top element.
2) C program to execute the following operations:
a) Deleting the topmost element.
b) Shifting all the elements towards the left.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #Stacks

[Error-gcrr]

God Bless these wonderful people. I can't explain in words how much your channel has helped me. Just Thank you !

[jericodcosta]

Best DSA course with crisp explaination.

[cannydou]

Though nothing can be given as I'm just a student, the least I can do is tell my children that blessed people like these still exists when I grow up.

[Best-swoi]

Thankyou sir... I was eagerly waiting for new video of this series...

[DrJALAGHARI]

What a wonderful information is shared through this amazing video.

[ritikshrivastava]

Thank you neso academy complete this asap

[beluga]

PLEASE provide the PPT's of the completed courses like TOC, C programming, DATA structure etc. Thank you🙆‍♂️

[soomann]

But wont it be O(n) for every insertion which is more time complexity to previous stack implementation where Insertion was O(1).

[vaibhavsingh]

i think here stack wont be able to pop last elemet left in stack

[crawler]

but how's the top most element is at the lowest part of the stack ?