#Modification 21

Author: amangit1314

binaryTree/BT_Problem_01.java

@@ -4,12 +4,13 @@
 // Find Level order traversal of binary tree
 class Node{
 	int data;
+	int hd;
 	Node left, right;
 
 	public Node(int item) {
 		data = item;
-		left = null;
-		right = null;
+		hd = Integer.MAX_VALUE;
+		left = right = null;
 	}
 }
 public class BT_Problem_01 {

binaryTree/BT_Problem_10.java

@@ -7,6 +7,21 @@
  */
 public class BT_Problem_10 {
 
+	Node root;
+	static int max_level = 0;
+	
+	void leftViewUtil(Node node, int level) {
+		
+		if(node == null)
+			return;
+		
+		if(max_level < level) {
+			System.out.print(" " + node.data);
+			max_level = level;
+		}
+		
+		
+	}
 	public static void main(String[] args) {
 
 

binaryTree/BT_Problem_11.java

@@ -1,9 +1,75 @@
 package binaryTree;
+import java.util.*;
+import java.util.Map.Entry;
 
+/*	
+ * Problem Title :- Write a Java program to find Top View of Tree. 
+ */
+// Class of binary Tree
 public class BT_Problem_11 {
 
+	Node root;
+	
+	public BT_Problem_11() {
+		root = null;
+	}
+	
+	// function should print the topView of the binary tree
+	private void TopView(Node root) {
+		class QueueObj{
+			Node node;
+			int hd;
+			QueueObj(Node node, int hd){
+				this.node = node;
+				this.hd = hd;
+			}
+		}
+		
+		Queue<QueueObj> q = new LinkedList<>();
+		Map<Integer, Node> topViewMap = new TreeMap<Integer, Node>();
+		
+		if(root == null)
+			return;
+		else
+			q.add(new QueueObj(root, 0));
+		
+		System.out.println("The top view of the tree is : ");
+		
+		/* count function returns 1 if the container
+		 * contains an element whose key is equivalent to hd,
+		 * or returns zero otherwise. */
+		while(!q.isEmpty()) {
+			QueueObj tempNode = q.poll();
+			
+			if(!topViewMap.containsKey(tempNode.hd)) 
+				topViewMap.put(tempNode.hd, tempNode.node);
+			
+			if(tempNode.node.left != null)
+				q.add(new QueueObj(tempNode.node.left, tempNode.hd + 1));
+			
+			if(tempNode.node.left != null)
+				q.add(new QueueObj(tempNode.node.left, tempNode.hd + 1));
+		}
+		
+		for(Entry<Integer, Node> entry : topViewMap.entrySet())
+			System.out.print(entry.getValue().data);
+	}
+	
+	// Driver Program to test & run above functions
 	public static void main(String[] args) {
 
+		BT_Problem_11 tree = new BT_Problem_11();
+		
+		tree.root = new Node(1);
+		tree.root.left = new Node(2);
+		tree.root.right = new Node(3);
+		tree.root.left.right = new Node(4);
+		tree.root.left.right.right = new Node(4);
+		tree.root.left.right.right.right = new Node(4);
+		
+		System.out.println("Following are nodes in top view of Binary Tree");
+		tree.TopView(tree.root);
+		
 	}
 
 }

binaryTree/BT_Problem_12.java

@@ -1,10 +1,64 @@
 package binaryTree;
+import java.util.*;
 
+/*	
+ * Problem Title :- Write a Java program to find Bottom View of Tree. 
+ */
 public class BT_Problem_12 {
 
+	Node root;
+	
+	public BT_Problem_12() {}
+	
+	public BT_Problem_12(Node node){
+		root = node;
+	}
+	
+	private void BottomView() {
+		
+		if(root == null)
+			return;
+		
+		// Initialize a variable 'hd' with 0 for the root element.
+		int hd = 0;
+		
+		// TreeMap which stores key value pair sorted on key value
+		Map<Integer, Integer> map= new TreeMap<>();
+		
+		// Queue to store tree nodes in level order traversal 
+		Queue<Node> q = new LinkedList<>();
+		
+		// Assign initialized horizontal distance value to root node and add it to the queue.
+		root.hd = hd;
+		q.add(root);
+		
+		while(!q.isEmpty()) {
+			Node temp = q.remove();
+			
+			hd = temp.hd;
+			
+			map.put(hd,  temp.data);
+			
+			if(temp.left != null) {
+				temp.left.hd = hd-1;
+				q.add(temp.left);
+			}
+			
+			if(temp.right != null) {
+				temp.right.hd = hd+1;
+				q.add(temp.right);
+			}
+			
+		}
+		
+		Set<Entry<Integer, Integer>> set = map.entrySet();
+		
+		Iterator<Entry<Integer, Integer>> iterator = set.iterator();
+	}
+	
+	
 	public static void main(String[] args) {
-		// TODO Auto-generated method stub
-
+		
 	}
 
 }

bitManipulation/BM_01.java

@@ -0,0 +1,24 @@
+package bitManipulation;
+
+/*
+ * Problem Title :-> Count set bits in an integer
+ */
+public class BM_01 {
+
+	// Function to get no of set bits in binary representation of positive integer n 
+	static int countSetBits(int n) {
+		int count = 0;
+		while(n > 0) {
+			count += n & 1;
+			n >>= 1;
+		}
+		return count;
+	}
+	
+	// driver program
+	public static void main(String[] args) {
+		int i = 9;
+		System.out.println(countSetBits(i));
+	}
+
+}

bitManipulation/BM_02.java

@@ -0,0 +1,10 @@
+package bitManipulation;
+
+public class BM_02 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}

bitManipulation/BM_03.java

@@ -0,0 +1,10 @@
+package bitManipulation;
+
+public class BM_03 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}

bitManipulation/BM_04.java

@@ -0,0 +1,10 @@
+package bitManipulation;
+
+public class BM_04 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}

bitManipulation/BM_05.java

@@ -0,0 +1,10 @@
+package bitManipulation;
+
+public class BM_05 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}

bitManipulation/BM_06.java

@@ -0,0 +1,10 @@
+package bitManipulation;
+
+public class BM_06 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}