Stacks (Program 1) – Part 1

preview_player
Показать описание
Data Structures: Stacks (Program 1) – Part 1
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) Keeping a track of the first inserted element.
b) Shifting all the elements one step towards the right and pushing the new element at index 0.

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

#DataStructuresByNeso #DataStructures #Stacks
Рекомендации по теме
Комментарии
Автор

Thanks a lot Neso for continuing this series 😊🤩

shreyassakriofficial
Автор

Please add this data structure course fast...i am waiting for a long time to complete this course

anujgupta
Автор

Hey neso academy please upload with faster frequency coz I really want to complete this course from here, the way you explain things are amazing. We really love and appreciate your efforts ❤️💕

snehilgupta
Автор

log2base2(ad) : Learning data structures and algorithm is difficult.
@NesoAcademy : Hold my beer!!!

sir plz complete the course..ASAP!!! 😢

aeroabrar_
Автор

Sir what is ordered list can u say in short with example

subikshasubiksha
Автор

U r implementing the stack in static memory
But how to do the same in dynamic memory heap ???😢😢

lokeshborole
Автор

Upload full data structures bro soon.... We are waiting for long 😞

kavin
Автор

Can any one clarify my doubt! stack representation is similar to bundle of plates right but here it looks like queue but not stack 1:08

joshna
Автор

but by using print(arr[2]) we can access third element ....
so this destroys stacks concept.

badprogrammer
Автор

lgta hain sir ko bukhaar ho gya hainnn😆😆

unusualmind
Автор

Code is fine but you haven't handle the case for overflow

ritikshrivastava