#12 Stack Implementation using Dynamic Array in Java

Stack implementation in Java without using Collection.

In this video we will see practical implementation of Stack using Dynamic Array in Java

We will see :
- Stack Operations on Dynamic array :
- Push
- Pop
- Size
- isFull
- expand
- shrink

Stack : It is Last-In-First-Out (LIFO) DS
The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack,
while getting to an item deeper in the stack may require taking off multiple other items first
We can perform 2 operation on it :
PUSH : which adds an element to the collection, and
POP : which removes the most recently added element that was not yet removed

Editing Monitors :

Follow on Facebook:

Subscribe to our other channel:
Telusko Hindi :

Donation:
PayPal Id : navinreddy20
Patreon : navinreddy20

[gracious_grace]

I have never understood stacks like I just did through your stack tutorials. God bless you

[SurajMahli]

4 Years BE + 4 Years in SDF, got clearity of Stack now, thanks Navin

[NPRBEST]

Amazing tutorial! No one teaches like you. Thanks a lot.

[cirilcyriac]

Best explanation, you can find anywhere in internet.

[chinmaydas]

We can get pseudo code implementation of this all data structure, algorithms concepts...but generally don't get very easy, in-depth implementations in programming languages what you are doing...and obviously java is the best programming language to implement all these great fundamental concepts..you are doing fabulous job..huge love and respect...

[health.upgradedbyscience.]

Perfect explanation as always in your tutorials - thanks a lot!!

[adityanarayandas]

I was searching for this dynamic expansion and shrinking in Stack.Thanks.

[AbinayaThiyagarajan]

requesting you to make a video on stack implementation using linked list in java

[chinmaydas]

Sir are doing excellent work ...we want total comprehensive series videos on data structures and algorithms analysis...exactly what you are doing now....stack, queue, sets, trees, graph algorithms like dfs, bfs, minimum spanning trees etc , hash tables, heap sort, binary search trees, red-black tree, avl tree, b trees, recursion, iteration, searching, sorting, dynamic programming, greedy algorithm, amortised analysis...a complete comprehensive course in beginners to advanced levels data structure and algorithms..it will be extremely helpful for all students sir..

[nitishnagpal]

Best Explanation in your all videos. Thanks a lot..!!

[divyagupta]

I actually understood it better when you actually showed the running code in output. Very nicely explained.

[ishwaryakanagaraman]

Thank you so much for this wonderful explanation. It is very clear and easy.

[alvinemulo]

Thanks sir for this amazing tutorial. It will be helpful if you add the full course covering all aspect of data structures and Algorithms

[entertinementworld]

hi sir i am learning so much because of your videos your teaching is very good no wasting time mainly.

[adithkrishnan]

Excellent explanation! Thanks a lot Mr.Navin!

[krex]

Thank you so much! I love the implementation but I do think you should check if the length is capacity/2/2 before calling shrink, then you dont call shrink every time you run the code.

[slobodantajisic]

In last two tutorials peek method is not good. What if stack is empty? stack[top-1] will be stack[-1]. Am I wrong?

[travelnlearn]

Thanks for this wonderful video. May gbu with lots of success love and life. Keep Rocking

[dipakraut]

At 8:24 why again the capacity is in increasing by 2, Because it is already increased in the newStack array by 2 in line-22.

[pavaniannam]

could you please explain search() method in stack which returns the index of the objects inserted