#Modification 12

Author: amangit1314

array/KadanesAlgorithm.class

@@ -1,75 +1,77 @@
 package stack;
+
 import java.util.*;
+
 //Program to convert infix to postfix
-public class Postfix{
+public class Postfix {
 
-    static int Prec(char ch){
-        switch(ch){
+    static int Prec(char ch) {
+        switch (ch) {
             case '+':
             case '-':
                 return 1;
-            
+
             case '*':
             case '/':
                 return 2;
-            
+
             case '^':
                 return 3;
         }
 
         return -1;
     }
 
-    static String infixToPostfix(String exp){
+    static String infixToPostfix(String exp) {
 
         String result = new String(" ");
         Stack<Character> stack = new Stack<>();
 
-        for(int i = 0 ; i < exp.length() ; ++i){
+        for (int i = 0; i < exp.length(); ++i) {
+
             char c = exp.charAt(i);
 
-            if(Character.isLetterOrDigit(c))
+            if (Character.isLetterOrDigit(c))
                 result += c;
 
-            else if(c == '(')
+            else if (c == '(')
                 stack.push(c);
 
-            else if (c == ')'){
-                while (!stack.isEmpty() && stack.peek() != '(') 
-                    result += stack.pop(); 
+            else if (c == ')') {
+                while (!stack.isEmpty() && stack.peek() != '(')
+                    result += stack.pop();
 
                 stack.pop();
             }
 
-            else{
-                while(!stack.isEmpty() && Prec(c) <= Prec(stack.peek())){
+            else {
+                while (!stack.isEmpty() && Prec(c) <= Prec(stack.peek())) {
                     result += stack.pop();
-                }   
+                }
             }
 
             stack.push(c);
         }
 
         while (!stack.isEmpty()) {
 
-            if(stack.peek() == '(')
+            if (stack.peek() == '(')
                 return "Invalid Expression";
 
-            result += stack.pop(); 
+            result += stack.pop();
         }
 
         return result;
     }
 
     public static void main(String[] args) {
 
+        //Taking String "exe" input
         Scanner sc = new Scanner(System.in);
         String exp = sc.nextLine();
         sc.close();
 
         Postfix p = new Postfix();
-
-        p = infixToPostfix(exp);
-        System.out.println(p);
+        System.out.println(infixToPostfix(exp));
     }
 }

searchingAlgorithms/BinarySearch.class

@@ -0,0 +1 @@
+{"name":"Local: BinaryTree_Traversal","url":"c:\\Users\\AmanSoni\\Desktop\\Java Program's\\Java-Eclipse\\Placement Prepration\\src\\trees\\BinaryTree_Traversal.java","tests":[{"id":1608219457557,"input":"","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\Users\\AmanSoni\\Desktop\\Java Program's\\Java-Eclipse\\Placement Prepration\\src\\trees\\BinaryTree_Traversal.java","group":"local","local":true}

stack/Postfix.java

@@ -1,20 +1,21 @@
 package trees;
 
 //java program for different tree traversals
-/*
- * Class containing left and right child of current node and key value
- */
-//class Node{
-//	int key;
-//	Node left, right;
-//	
-//	public Node(int item) {
-//		key = item;
-//		left = right = null;
-//	}
-//}
 
 public class BinaryTree_Traversal {
+
+	/*
+ 	* Class containing left and right child of current node and key value
+ 	*/
+	class Node{
+		int key;
+		Node left, right;
+		
+		public Node(int item) {
+			key = item;
+					left = right = null;
+		}
+	}
 
 	//root of binary Tree
 	Node root;
@@ -75,11 +76,11 @@ public static void main(String[] args) {
 
 		BinaryTree_Traversal tree = new BinaryTree_Traversal();
 
-		tree.root = new Node(1);
-		tree.root.left = new Node(2);
-		tree.root.right = new Node(3);
-		tree.root.left.left = new Node(4);
-		tree.root.left.right = new Node(5);
+		tree.new Node(1);
+		tree.new Node(2);
+		tree.new Node(3);
+		tree.new Node(4);
+		tree.new Node(5);
 
 		System.out.println("Preorder traversal of binary tree is ");
 		tree.printPreorder();