Binary Tree Updates

Binary Tree Updates

Author: careermonk

bin/chapter6trees/FillNextSiblingsWithLevelOrder.class

@@ -0,0 +1,44 @@
+/*Copyright (c) Dec 22, 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			: FillNextSiblings.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;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class FillNextSiblingsWithLevelOrder {
+    public static void fillNextSiblings(SiblingBinaryTreeNode root) {
+    	SiblingBinaryTreeNode tmp = null;
+    	if (root == null)
+			return;
+		// Initialization
+		Queue<SiblingBinaryTreeNode> q = new LinkedList<SiblingBinaryTreeNode>();
+		q.offer(root);
+		q.offer(null);
+		while (!q.isEmpty()) {
+			tmp = q.poll();
+			if (tmp != null) {
+				tmp.setNextSibling(q.peek());
+				if (tmp.getLeft() != null)
+					q.offer(tmp.getLeft());
+				if (tmp.right != null)
+					q.offer(tmp.right);
+			} else {
+				// completion of a level;
+				if (!q.isEmpty())
+					q.offer(null);
+			}
+		}
+    }
+}

bin/chapter6trees/FillNextSiblingsWithRecursion.class

@@ -0,0 +1,19 @@
+/*Copyright (c) Dec 22, 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			: FillNextSiblingsWithRecursion.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 FillNextSiblingsWithRecursion {
+
+}

bin/chapter6trees/PrintAllAncestors.class

@@ -0,0 +1,28 @@
+/*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			: PrintAllAncestors.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 PrintAllAncestors {
+	public static boolean printAllAncestors(BinaryTreeNode root, BinaryTreeNode node){
+		if(root == null) 
+			return false;
+		if(root.getLeft() == node || root.getRight() == node || 
+			printAllAncestors(root.getLeft(), node) || printAllAncestors(root.getRight(), node)) {
+			System.out.println(root.getData());
+			return true;
+		}
+		return false;
+	}
+}

bin/chapter6trees/SiblingBinaryTreeNode.class

@@ -0,0 +1,67 @@
+/*Copyright (c) Dec 22, 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			: SiblingBinaryTreeNode.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 SiblingBinaryTreeNode {
+	public int data;	
+	public SiblingBinaryTreeNode left;
+	public SiblingBinaryTreeNode right;
+	public SiblingBinaryTreeNode nextSibling;
+	
+	public SiblingBinaryTreeNode(int data){
+		this.data = data;
+		left = null;
+		right = null;
+		nextSibling = null;
+	}
+	public SiblingBinaryTreeNode(int data, SiblingBinaryTreeNode left, SiblingBinaryTreeNode right, SiblingBinaryTreeNode nextSibling){
+		this.data = data;
+		this.left = left;
+		this.right = right;
+		this.nextSibling = nextSibling;
+	}
+	public int getData() {
+		return data;
+	}
+	public void setData(int data) {
+		this.data = data;
+	}
+	public SiblingBinaryTreeNode getLeft() {
+		return left;
+	}
+	public void setLeft(SiblingBinaryTreeNode left) {
+		this.left = left;
+	}
+	public SiblingBinaryTreeNode getRight() {
+		return right;
+	}
+	public void setRight(SiblingBinaryTreeNode right) {
+		this.right = right;
+	}
+	public SiblingBinaryTreeNode getNextSibling() {
+		return nextSibling;
+	}
+	public void setNextSibling(SiblingBinaryTreeNode nextSibling) {
+		this.nextSibling = nextSibling;
+	}
+	// Sets the data in this BinaryTreeNode node.
+	public void setValue(int data) {
+		this.data = data;
+	}
+	// Tests whether this node is a leaf node.
+	public boolean isLeaf() {
+		return left == null && right == null;
+	}
+}

bin/chapter6trees/VerticalSum.class

@@ -0,0 +1,39 @@
+/*Copyright (c) Dec 22, 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			: VerticalSum.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;
+
+import java.util.HashMap;
+
+public class VerticalSum {
+	public static void vSum(HashMap <Integer, Integer> hash,BinaryTreeNode root, int c){
+        if(root.left!=null)
+        	vSum(hash, root.left, c-1);
+        if(root.right!=null)
+        	vSum(hash,root.right, c+1);
+        int data=0;
+        if(hash.containsKey(c))
+            data=hash.get(c);
+        hash.put(c, root.data+data);
+    }
+    public static void verticalSum(BinaryTreeNode root){
+        HashMap <Integer, Integer> hash = new HashMap<Integer, Integer>();
+        vSum(hash, root, 0);
+        System.out.println();
+         
+        for(int k:hash.keySet()){
+            System.out.println("key(pos): "+k+ " sum: "+ hash.get(k)+" ");     
+        }
+    }
+}