#Modification 30

Author: amangit1314

oopsabstraction/Audi.class renamed to abstraction/Audi.class

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

oopsabstraction/Audi.java renamed to abstraction/Audi.java

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

oopsabstraction/Car.class renamed to abstraction/Car.class

@@ -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);
+	}
+}

oopsabstraction/Car.java renamed to abstraction/Car.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");
+	}
+}

oopsabstraction/RepairShop.class renamed to abstraction/RepairShop.class

@@ -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();
 
-
 	}
 
 }

abstraction/RepairShop.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 {