Created
February 19, 2016 04:34
-
-
Save thmain/c0439fb8fb4ff95af5bc to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class StackUsingLinkedList { | |
Node head= null; | |
int size =0; | |
public void push(int data){ | |
Node x = new Node(data); | |
if(getSize()==0){ | |
head = x; | |
}else{ | |
//add the Node at the start of a Linked List | |
Node temp = head; | |
x.next = temp; | |
head = x; | |
} | |
System.out.println("Element "+ data + " is pushed into Stack"); | |
size++; | |
} | |
public int pop(){ | |
if(getSize()==0){ | |
System.out.println("Stack is Empty"); | |
return -1; | |
}else{ | |
Node temp = head; | |
head = head.next; | |
size--; | |
return temp.data; | |
} | |
} | |
public void printStack(){ | |
Node curr = head; | |
while(curr!=null){ | |
System.out.print(curr.data + " "); | |
curr = curr.next; | |
} | |
System.out.println(); | |
} | |
public int getSize(){ | |
return size; | |
} | |
public static void main(String[] args) { | |
StackUsingLinkedList stck = new StackUsingLinkedList(); | |
stck.push(1); | |
stck.push(2); | |
stck.push(4); | |
stck.printStack(); | |
System.out.println("Pop out element " + stck.pop()); | |
stck.printStack(); | |
} | |
} | |
class Node{ | |
int data; | |
Node next; | |
public Node(int data){ | |
this.data = data; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment