Tree Updates

Tree Updates

Author: careermonk

bin/chapter6trees/CheckStructurullySameTrees.class

@@ -0,0 +1,26 @@
+/*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			: CheckStructurullySameTrees.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 CheckStructurullySameTrees {
+    public boolean checkStructurullySameTrees(BinaryTreeNode  root1, BinaryTreeNode  root2) {
+    	if(root1 == null && root2 == null) 	
+            return true;
+    	if(root1 == null || root2 == null) 
+            return false;
+    	return (checkStructurullySameTrees(root1.getLeft(), root2.right) && 
+    			checkStructurullySameTrees(root1.right, root2.getLeft()));
+     }
+}

bin/chapter6trees/DeepestNode.class

@@ -0,0 +1,37 @@
+/*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			: DeepestNode.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 DeepestNode {
+	// The last node processed from queue in level order is the deepest node in binary tree.
+	public BinaryTreeNode deepestNodeinBinaryTree(BinaryTreeNode root) {
+		BinaryTreeNode tmp = null;
+    	if(root == null)
+            return null;
+        Queue<BinaryTreeNode> q = new LinkedList<BinaryTreeNode>();
+        q.offer(root);
+        while(!q.isEmpty()){
+        	tmp = q.poll();
+            if(tmp.getLeft() != null)
+                q.offer(tmp.getLeft());
+            if(tmp.right != null)
+                q.offer(tmp.right);
+        }
+		return tmp;
+	}
+}