Updates

Updates

Author: careermonk

bin/chapter3linkedlists/ListNode.class

@@ -12,24 +12,44 @@
 
 package chapter3linkedlists;
 
-class ListNode {
-	int data;
-	ListNode next;
- 
-	ListNode(int x) {
-		data = x;
+public class ListNode{
+	public ListNode next;
+	public int data;
+
+	// Creates an empty node.
+	public ListNode(){
 		next = null;
+		data = Integer.MIN_VALUE;
 	}
-	public int getData(){
-		return this.data;
-	}
-	public void setData(int data){
-		this.data = data;
+
+	// Creates a node storing the specified data.
+	public ListNode (int elem){
+		next = null;
+		data = elem;
 	}
+
+	// Returns the node that follows this one.
 	public ListNode getNext(){
-		return this.next;
+		return next;
 	}
-	public void setNext(ListNode node){
-		this.next = node;
+
+	// Sets the node that follows this one.
+	public void setNext (ListNode node){
+		next = node;
+	}
+
+	// Returns the data stored in this node.
+	public int getdata(){
+		return data;
+	}
+
+	// Sets the data stored in this node.
+	public void setdata (int elem){
+		data = elem;
 	}
-}
+	
+	// Sets the data stored in this node.
+	public String toString (){
+		return Integer.toString(data);
+	}	
+}

bin/chapter4stacks/LinkedStack.class

@@ -0,0 +1,80 @@
+/*Copyright (c) Dec 21, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: StackWithLinkedList.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package chapter4stacks;
+import chapter3linkedlists.*;
+import java.util.EmptyStackException;
+
+public class LinkedStack<T>{
+	private int length;  		// indicates the size of the linked list
+	private ListNode top; 
+
+	//  Constructor: Creates an empty stack.
+	public LinkedStack()  {
+		length = 0;
+		top = null;
+	}
+	  
+	//  Adds the specified data to the top of this stack.
+	public void push (int data)  {
+		ListNode temp = new ListNode (data);
+		temp.setNext(top);
+		top = temp;
+		length++;
+	}
+	  
+	//  Removes the data at the top of this stack and returns a
+	//  reference to it. Throws an EmptyStackException if the stack
+	//  is empty.
+	public int pop() throws EmptyStackException{
+		if (isEmpty())
+			throw new EmptyStackException();
+		int result = top.getdata();
+		top = top.getNext();
+		length--;
+		return result;
+	}	   
+	  
+	// Returns a reference to the data at the top of this stack.
+	// The data is not removed from the stack.  Throws an
+	// EmptyStackException if the stack is empty.  
+	public int peek() throws EmptyStackException{
+		if (isEmpty())
+			throw new EmptyStackException(); 
+
+		return top.getdata();
+	}
+
+	// Returns true if this stack is empty and false otherwise. 
+	public boolean isEmpty(){
+		return (length == 0);
+	}
+	 	  
+	// Returns the number of elements in the stack.
+	public int size(){
+		return length;
+	}
+
+	// Returns a string representation of this stack.   
+	public String toString(){
+		String result = "";
+		ListNode current = top;
+		while (current != null){
+			result = result + current.toString() + "\n";
+			current = current.getNext();
+		}
+
+		return result;
+	}
+}

bin/chapter6trees/ListNode.class

@@ -11,7 +11,7 @@
  */
 
 package chapter6trees;
-
+import chapter3linkedlists.*;
 public class SortedArrayToBST {
     // bottom up
     public BinarySearchTreeNode sortedListToBST(ListNode head) {