Tree Updates

Tree Updates

Author: careermonk

bin/chapter6trees/BinaryTreeNode.class

@@ -170,7 +170,7 @@ public String toString() {
 			return result+"]";
 		}
 		result = result + head.getData();
-		ListNode temp = head.getNext();;
+		ListNode temp = head.getNext();
 		while (temp != null) {
 			result = result + "," + temp.getData();
 			temp = temp.getNext();

bin/chapter6trees/MaxInBinaryTreeRecursive.class

@@ -12,13 +12,31 @@
 
 package chapter6trees;
 
-public class BinaryTreeNode {
-	int data;
-	BinaryTreeNode left;
-	BinaryTreeNode right;
-	BinaryTreeNode(int x) {
-		data = x;
+public class BinaryTreeNode {	
+	public int data;	
+	public BinaryTreeNode left;
+	public BinaryTreeNode right;
+	public BinaryTreeNode(int data){
+		this.data = data;
 		left = null;
 		right = null;
 	}
+	public int getData() {
+		return data;
+	}
+	public void setData(int data) {
+		this.data = data;
+	}
+	public BinaryTreeNode getLeft() {
+		return left;
+	}
+	public void setLeft(BinaryTreeNode left) {
+		this.left = left;
+	}
+	public BinaryTreeNode getRight() {
+		return right;
+	}
+	public void setRight(BinaryTreeNode right) {
+		this.right = right;
+	}
 }

bin/chapter6trees/MinInBinaryTreeRecursive.class

@@ -0,0 +1,33 @@
+package chapter6trees;
+
+/*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			: MaxInBinaryTree.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. 
+ * 
+ */
+
+public class MaxInBinaryTreeRecursive {
+	public int maxInBinaryTree(BinaryTreeNode root){
+	    int maxValue = Integer.MIN_VALUE;
+	    if (root != null){
+	        int leftMax = maxInBinaryTree(root.left);
+	        int rightMax = maxInBinaryTree(root.right);
+	         
+	        if (leftMax > rightMax)
+	        	maxValue = leftMax;
+	        else
+	        	maxValue = rightMax;
+	             
+	        if (root.data > maxValue)
+	        	maxValue = root.data;
+	    }
+	    return maxValue;
+	}
+}

src/chapter3linkedlists/LinkedList.java

@@ -0,0 +1,34 @@
+/*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			: MinInBinaryTreeRecursive.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 chapter6trees;
+
+public class MinInBinaryTreeRecursive {
+	public int minInBinaryTree(BinaryTreeNode root){
+	    int minValue = Integer.MAX_VALUE;
+	    if (root != null){
+	        int leftMin = minInBinaryTree(root.left);
+	        int rightMin = minInBinaryTree(root.right);
+	         
+	        if (leftMin > rightMin)
+	        	minValue = leftMin;
+	        else
+	        	minValue = rightMin;
+	             
+	        if (root.data < minValue)
+	        	minValue = root.data;
+	    }
+	    return minValue;
+	}
+}