#Modification 30

oopsabstraction/Audi.java → abstraction/Audi.java

@@ -1,4 +1,4 @@
-package oopsabstraction;
+package abstraction;
 
 //Audi Class
 public class Audi extends Car{

oopsabstraction/Car.java → abstraction/Car.java

@@ -1,4 +1,4 @@
-package oopsabstraction;
+package abstraction;
 
 public abstract class Car {
 	public abstract void accelerate();

abstraction/RepairShop.java

@@ -0,0 +1,20 @@
+package abstraction;
+
+public class RepairShop {
+
+	public static void repairCar(Car car) {
+		System.out.println("Car is repaired");
+	}
+
+	public static void repairCar(Car...Audi) {
+		System.out.println("Car is repaired");
+	}
+
+	public static void main(String[] args) {
+		WagonR wagonR = new WagonR();
+		Audi audi = new Audi();
+
+		repairCar(wagonR);
+		repairCar(audi);
+	}
+}

abstraction/WagonR.java

@@ -0,0 +1,14 @@
+package abstraction;
+
+public class WagonR extends Car{
+
+	@Override
+	public void accelerate() {
+		System.out.println("WagonR is accelerating");
+	}
+
+	@Override
+	public void apply_break() {
+		System.out.println("break is applied in WagonR");
+	}
+}

binaryTree/BT_Problem_10.java

@@ -5,26 +5,47 @@
  *  The right view of a binary tree, is set of nodes visible when tree is visited from rights side
  *  between two end nodes.
  */
+class Max_level{
+	int max_level;
+}
 public class BT_Problem_10 {
 
 	Node root;
-	static int max_level = 0;
 
-	void leftViewUtil(Node node, int level) {
+	Max_level max_level = new Max_level();
+
+	void rightViewUtil(Node node, int level, Max_level max_level) {
 
 		if(node == null)
 			return;
 
-		if(max_level < level) {
-			System.out.print(" " + node.data);
-			max_level = level;
+		if(max_level.max_level < level) {
+			System.out.print(node.data + " " );
+			max_level.max_level = level;
 		}
 
-
+		rightViewUtil(node.right, level+1,max_level);
+		rightViewUtil(node.left, level+1,max_level);
+	}
+
+	void rightView() {
+		rightView(root);
 	}
+
+	void rightView(Node node) {
+		rightViewUtil(node, 1, max_level);
+	}
+
 	public static void main(String[] args) {
+		BT_Problem_10 tree = new BT_Problem_10();
+		tree.root = new Node(12);
+		tree.root.left = new Node(10);
+		tree.root.right = new Node(30);
+		tree.root.right.left = new Node(25);
+		tree.root.right.right = new Node(40);
+
+		tree.rightView();
 
-
 	}
 
 }

binaryTree/BT_Problem_15.java

@@ -2,7 +2,7 @@
 import java.util.*;
 import java.util.Map.Entry;
 /*
- * Problem Title :- Diagnol Traversal of a Binary tree
+ * Problem Title :- Daignol Traversal of a Binary tree
  */
 public class BT_Problem_15 {
 

binaryTree/BT_Problem_17.java

@@ -1,10 +1,86 @@
 package binaryTree;
-
+import java.util.*;
+/*	
+ * Problem Title :- Construct Binary Tree from String with Bracket Representation. 
+ */
 public class BT_Problem_17 {
-
+	// Binary Tree node
+	static class Node{
+		int data;
+		Node left, right;
+	};
+
+	// Helper function that allocates a new node
+	static Node newNode(int data) {
+		Node node = new Node();
+		node.data = data;
+		node.left = node.right = null;
+		return(node);
+	}
+
+	// function just for testing
+	static void preOrder(Node node) {
+		if(node == null)
+			return;
+		System.out.printf("%d ", node.data);
+		preOrder(node.left);
+		preOrder(node.right);
+	}
+
+	// function to return the index of close parenthesis
+	static int findIndex(String str, int si, int ei) {
+		// base case
+		if(si > ei)	
+			return -1;
+		//Inbuilt Stack
+		Stack<Character> s = new Stack<>();
+		// loop for iterations of the index
+		for(int i = si; i <= ei; i++) {
+			// if open parenthesis, push it to the stack
+			if(str.charAt(i) == '(')	
+				s.add(str.charAt(i));
+			// if close parenthesis, pop it and else stack is empty that will be the required index 
+			else if(str.charAt(i) == ')') {
+				if(s.peek() == '(') {
+					// pop from stack
+					s.pop();
+					//if stack is empty, this is the required index
+					if(s.isEmpty())	return i;
+				}
+			}
+		}
+		return -1;
+	}
+
+	// function to construct tree from string
+	static Node treeFromString(String str, int si, int ei) {
+
+		// Base Case
+		if(si > ei)	return null;
+
+		// new root
+		Node root = newNode(str.charAt(si) - '0');
+		int index = -1;
+
+		// if next char is '(' find the index of its complement
+		if(si + 1 <= ei && str.charAt(si+1) == '(') 
+			index = findIndex(str, si + 1, ei);
+
+		// if index found
+		if(index != -1) {
+			// call for left subtree
+			root.left = treeFromString(str, si+2, index - 1);
+			// call for left subtree
+			root.right = treeFromString(str, index + 2, ei - 1);
+		}
+		return root;
+	}
+
+	//Driver Code
 	public static void main(String[] args) {
-		// TODO Auto-generated method stub
-
+		String str = "4(2(3)(1))(6(5))";
+		Node root = treeFromString(str, 0, str.length() - 1);
+		preOrder(root);
 	}
 
 }

binaryTree/BT_Problem_18.java

@@ -1,9 +1,10 @@
 package binaryTree;
-
+/*	
+ * Problem Title :- Convert Binary tree into Doubly Linked List 
+ */
 public class BT_Problem_18 {
 
 	public static void main(String[] args) {
-		// TODO Auto-generated method stub
 
 	}
 

binaryTree/BT_Problem_19.java

@@ -1,5 +1,7 @@
 package binaryTree;
-
+/*	
+ * Problem Title :- Construct Binary Tree from String with Bracket Representation. 
+ */
 public class BT_Problem_19 {
 
 	public static void main(String[] args) {

binaryTree/BT_Problem_20.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_20 {
+
+}

binaryTree/BT_Problem_21.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_21 {
+
+}

binaryTree/BT_Problem_22.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_22 {
+
+}

binaryTree/BT_Problem_23.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_23 {
+
+}

binaryTree/BT_Problem_24.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_24 {
+
+}

binaryTree/BT_Problem_25.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_25 {
+
+}

binaryTree/BT_Problem_26.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_26 {
+
+}

binaryTree/BT_Problem_27.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_27 {
+
+}

binaryTree/BT_Problem_28.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_28 {
+
+}

binaryTree/BT_Problem_29.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_29 {
+
+}

binaryTree/BT_Problem_30.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_30 {
+
+}

binaryTree/BT_Problem_32.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_32 {
+
+}

binaryTree/BT_Problem_33.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_33 {
+
+}

binaryTree/BT_Problem_34.java

@@ -0,0 +1,5 @@
+package binaryTree;
+
+public class BT_Problem_34 {
+
+}

bitManipulation/BM_02.java

@@ -1,10 +1,11 @@
 package bitManipulation;
-
+/*	
+ * Problem Title :- Find the two non-repeating elements in an array of repeating elements
+ */
 public class BM_02 {
 
 	public static void main(String[] args) {
-		// TODO Auto-generated method stub
-
+
 	}
 
 }

bitManipulation/BM_03.java

@@ -1,5 +1,7 @@
 package bitManipulation;
-
+/*	
+ * Problem Title :- Count number of bits to be flipped to convert A to B
+ */
 public class BM_03 {
 
 	public static void main(String[] args) {

bitManipulation/BM_04.java

@@ -1,5 +1,7 @@
 package bitManipulation;
-
+/*	
+ * Problem Title :- Count total set bits in all numbers from 1 to n
+ */
 public class BM_04 {
 
 	public static void main(String[] args) {

bitManipulation/BM_05.java

@@ -1,5 +1,7 @@
 package bitManipulation;
-
+/*	
+ * Problem Title :- Program to find whether a no is power of two
+ */
 public class BM_05 {
 
 	public static void main(String[] args) {

bitManipulation/BM_06.java

@@ -1,5 +1,7 @@
 package bitManipulation;
-
+/*	
+ * Problem Title :- Find position of the only set bit
+ */
 public class BM_06 {
 
 	public static void main(String[] args) {

bitManipulation/BM_07.java

@@ -1,5 +1,7 @@
 package bitManipulation;
-
+/*	
+ * Problem Title :- Copy set bits in a range
+ */
 public class BM_07 {
 
 	public static void main(String[] args) {

bitManipulation/BM_08.java

@@ -1,5 +1,7 @@
 package bitManipulation;
-
+/*	
+ * Problem Title :- Divide two integers without using multiplication, division and mod operator
+ */
 public class BM_08 {
 
 	public static void main(String[] args) {

bitManipulation/BM_09.java

@@ -1,5 +1,7 @@
 package bitManipulation;
-
+/*	
+ * Problem Title :- Calculate square of a number without using *, / and pow()
+ */
 public class BM_09 {
 
 	public static void main(String[] args) {