LINKED LIST STACK JAVA HOW TO

Using generics you can only insert one type of object, only you have to mention about data type during creating stack object and thus only need to create seperate stack objects and not programs. We also keep track of the size and capacity of the stack. So a new feature GENERICS was introduced to make it type safe. We keep a LinkedList pointer to point to the top of the stack and keep its track. But while popping you won't be able to understand the data type of the elements and so won't be able to typecast and use it properly and hence not type safe. When you are pushing into stack then you can push any object in this case.

But if you use this then a problem will arise. Stack Operations: push() : Insert the element into linked list at the beginning and increase the size of the list. The advantage of using a linked list over arrays is that it is possible to implement a stack that can grow or shrink as much as needed. Solution is quite simple, Earlier we have seen an article Linked List Implementation, we need to make some changes to make it work as Stack. But this can be avoided if we use as data type for stack elements. In linked list implementation, a stack is a pointer to the head of the list where pushing and popping items happens, with perhaps a counter to keep track of the list’s size. For different types you have to write seperate programs.

But that stack can take input of only one type of objects.

LINKED LIST STACK JAVA HOW TO

Hope that you already know how to create a stack. Today I am going to show how you can create your own stack using linked list. A stack using a linked list is just a simple linked list with just restrictions that any element will be added and removed using push and pop respectively.

Linked list stack java