stack using ll

anmolpant · anmolpant · commit eec4a14aed2b · 2021-01-27T14:04:28.000+05:30
diff --git a/Data Structures in Java/Level 2/Stacks and Queues/Stack_Using_LL/Node.java b/Data Structures in Java/Level 2/Stacks and Queues/Stack_Using_LL/Node.java
@@ -0,0 +1,12 @@
+
+public class Node<T> {
+	
+	T data;
+	Node<T> next;
+	
+	Node(T data){
+		this.data = data;
+		next = null;
+	}
+	
+}
diff --git a/Data Structures in Java/Level 2/Stacks and Queues/Stack_Using_LL/StackEmptyException.java b/Data Structures in Java/Level 2/Stacks and Queues/Stack_Using_LL/StackEmptyException.java
@@ -0,0 +1,10 @@
+
+public class StackEmptyException extends Exception {
+
+	/**
+	 * 
+	 */
+	private static final long serialVersionUID = 1L;
+
+
+}
diff --git a/Data Structures in Java/Level 2/Stacks and Queues/Stack_Using_LL/StackUse.java b/Data Structures in Java/Level 2/Stacks and Queues/Stack_Using_LL/StackUse.java
@@ -0,0 +1,23 @@
+
+public class StackUse {
+
+	public static void main(String[] args) throws StackFullException {
+		
+		StackUsingLL<Integer> stack = new StackUsingLL<>();
+		
+//		StackUsingArray stack = new StackUsingArray(3);
+		for(int i = 1; i <= 5; i++){
+			stack.push(i);
+		}
+		
+		while(!stack.isEmpty()){
+			try {
+				System.out.println(stack.pop());
+			} catch (StackEmptyException e) {
+				// Never reach here
+			}
+		}
+
+	}
+
+}
diff --git a/Data Structures in Java/Level 2/Stacks and Queues/Stack_Using_LL/StackUsingLL.java b/Data Structures in Java/Level 2/Stacks and Queues/Stack_Using_LL/StackUsingLL.java
@@ -0,0 +1,59 @@
+
+public class StackUsingLL<T> {
+
+
+	private Node<T> head;
+	private int size;
+
+	public StackUsingLL() {
+		head = null;
+		size = 0;	
+	}
+
+	int size(){
+		return size;
+	}
+	boolean isEmpty(){
+		return size() == 0; // head == null
+	}
+
+	T top() throws StackEmptyException{
+		if(size() == 0){
+			//StackEmptyException e = new StackEmptyException();
+			//throw e;
+			throw new StackEmptyException();
+		}
+		return head.data;
+	}
+
+	void push(T element){
+		
+		Node<T> newNode = new Node<T>(element);
+		newNode.next = head;
+		head = newNode;
+		size++;
+		
+	}
+
+	T pop() throws StackEmptyException{
+		if(size() == 0){
+			//StackEmptyException e = new StackEmptyException();
+			//throw e;
+			throw new StackEmptyException();
+		}
+		T tempdata = head.data;
+		head = head.next;
+		size--;
+		return tempdata;
+	
+	}
+
+
+	
+	
+	
+
+	
+	
+
+}

-Original file line number
+Diff line change
@@ @@ -0,0 +1,10 @@ @@
++
 +public class StackEmptyException extends Exception {
++
 +	/**
 +	 *
 +	 */
 +	private static final long serialVersionUID = 1L;
++
++
 +}