Java

class Solution {
    public boolean isSymmetric(TreeNode root) {
        boolean flag = false;
        if (root == null) return true;
        if(root.left == root.right != null) 
            flag = twoSymmetric(root.left , root.right);
        retrun flag;
    }
    
    public boolean twoSymmetric(TreeNode left , TreeNode right){
        if (left.left.val == right.right.val != null && left.right.val == right.left.val != null) return twoSymmetric(left.left , right.rigth) && twoSymmetric(left.right , right.left);
        else return false;
    }
}

cronie-anacron::1.4.11::17.el7::x86_64::Friday 05 January 2018 11:13:34 AM IST

accountsservice :: 0.6.40-2ubuntu11.3 :: None :: amd64 :: None

  private List<Transformation> foo;
... [omitted for brevity]
  public List<Transformation> getFoo() {
    List<Transformation> bar = new ArrayList<Transformation>(foo.size());

    for (Transformation listEntry : foo) {
      bar.add(Transformation.of(listEntry));
    }

    return bar;
  }

package com.nec;

import java.util.Scanner;

public class Inputs {
	private static Scanner s;
	private static String grade;
	private static Boolean flag;
	private static double averageSum;
	private static int studentCounter;
	private static Double classAverage;

	public static void main(String[] args)
	 {
		grade = "";
		flag = true;
		averageSum = 0;
		studentCounter = 0;
		
		//Inserting While statement to to check for more information
		While (flag); {
			flag = (false); 
		
		s = new Scanner (System.in);
		System.out.print("Enter your name: ");
		String name = s.next();
		System.out.print("Enter scores in three subjects: ");
		int scores1 = s.nextInt();
		int scores2 = s.nextInt();
		int scores3 = s.nextInt();
		double average = (scores1+scores2+scores3) /3.0;
		averageSum = averageSum + average; 
		studentCounter++;
		//System.out.println("\nName: " +name);
		//System.out.println("Average: " +average);
		
		if  (average >= 93) {
			grade = "A";
		}
		if  (average >= 90 && average < 93)  {
			grade = "A-";
		}
		if  (average >= 87 && average < 90) {
			grade = "B+";
		}
		if  (average >= 83 && average < 87) {
			grade = "B";
		}
		if  (average >= 80 && average < 83) {
			grade = "B-";
		}
		if  (average >= 77 && average < 80) {
			grade = "C+";
		}
		if  (average >= 73 && average < 77) {
			grade = "C";
		}
		if  (average >= 70 && average < 73) {
			grade = "C-";
		}
		if  (average >= 67 && average < 70) {
			grade = "D+";
		}
		if  (average >= 63 && average < 67) {
			grade = "D";
		}
		if  (average >= 60 && average < 63) {
			grade = "D-";
		}
		if  (average >= 0 && average < 60) {
			grade = "F";
		}
		
		
			
		
		System.out.println("\nName: " +name);
		System.out.println("Average: " +average);
		System.out.println("grade:" +grade);
		System.out.println("Do you have another set of scores to compute, enter 1 for yes and 0 for no");
			
		int ans2 = s.nextInt();
		//if statement to close the while loop
		if (ans2 == 1) flag = true;
		if (ans2 == 0) flag = false;}
		
		classAverage = averageSum / studentCounter;
		System.out.println("Class Average is:" +classAverage);
			

	}
	
	private static void While(Boolean flag2) {
		// TODO Auto-generated method stub
		
	}

}

class BookTestCase {
	
	private BookApp obj;
	private Book[] book = new Book[5];

	@BeforeEach
	void setUp() throws Exception {
		this.obj = new BookApp();
		book[0] = new Book(1, "HTLM", 56.0);
		book[1] = new Book(2, "Java", 128.0);
		book[2] = new Book(3, "Python", 34.99);
		book[3] = new Book(4, "C#", 40.0);
		book[4] = new Book(5, "C", 115.5);
	}

	@Test 
	void testPopulateBooks() {
		Assertions.assertThrows(IllegalArgumentException.class, () -> obj.populateBooks(6));
	}
	
	@Test
	void testMinPrice() {
		assertEquals(34.99, BookApp.minPrice(book), 0.0001);
	}
}

public class BookApp {
     /**
	 * this method calculate the minimum price of books
	 * @param b
	 * @return the minimum price
	 */
	public static double minPrice(Book[] b) {
		double min = b[0].getPrice();
		for (int i = 1; i < b.length; i++) {
			if (b[i].getPrice() < min)
				min = b[i].getPrice();
		}
		return min;
	}
}