#10 Stack Implementation using Java Part 1 | Push Pop Peek Methods
Complete playlist of Data Structure Using Java : https://goo.gl/3eQAYB 
 
Stack implementation in Java without using Collection. 
 
In this video we will see practical implementation of Stack without using Collection in Java 
 
We will see  : 
- Stack Operations : 
  - Push 
  - Pop 
  - Peek 
  - Show 
 
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 : 
https://amzn.to/2RfKWgL 
https://amzn.to/2Q665JW 
https://amzn.to/2OUP21a. 
 
 
Check out our website: http://www.telusko.com 
 
Follow Telusko on Twitter: https://twitter.com/navinreddy20 
 
Follow on Facebook:  
Telusko : https://www.facebook.com/teluskolearn... 
Navin Reddy : https://www.facebook.com/navintelusko 
 
Follow Navin Reddy on Instagram: https://www.instagram.com/navinreddy20 
 
Subscribe to our other channel: 
Navin Reddy : https://www.youtube.com/channel/UCxmk... 
Telusko Hindi : 
https://www.youtube.com/channel/UCitz... 
 
 
Donation: 
PayPal Id : navinreddy20 
Patreon : navinreddy20 
http://www.telusko.com/contactus
- 
							Category


No comments found