Added new solutions to chapter 25 exercises

Author: HarryDulaney

README.md

@@ -29,27 +29,24 @@ to check your work.
 		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_12"><strong>Chapter 12</strong></a> - Exception Handling and Text I/O</li><br>
 		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_13"><strong>Chapter 13</strong></a> - Abstract Classes and Interfaces</li><br>
 		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_14"><strong>Chapter 14</strong></a> - JavaFx Basics</li><br>
-		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_15"><strong>Chapter 15</strong></a> - Event-Driven Programming and Animations</li><br>
-		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_16"><strong>Chapter 16</strong></a> - JavaFx UI Controls and Multimedia</li><br>
+		<li><strong>Chapter 15</strong> - Event-Driven Programming and Animations</li><br>
+		<li><strong>Chapter 16</strong> - JavaFx UI Controls and Multimedia</li><br>
 		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_17"><strong>Chapter 17</strong></a> - Binary I/O</li><br>
 		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_18"><strong>Chapter 18</strong></a> - Recursion</li><br>
 		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_19"><strong>Chapter 19</strong></a> - Generics</li><br>
 		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_20"><strong>Chapter 20</strong></a> - Lists, Stacks, Queues, and Priority Queues</li><br>
 		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_21"><strong>Chapter 21</strong></a> - Sets and Maps</li><br>
+		<li><a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/ch_25"><strong>Chapter 25</strong></a> - Binary Search Trees </li><br>
 		<span><i> Looking to contribute? There's more to do: </i></span><br><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 22</strong></a> - Developing Efficient Algorithms</li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 23</strong></a> - Sorting</li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 24</strong></a> - Implementing Lists, Stacks, Queues, and Priority Queues</li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 25</strong></a> - Binary Search Trees </li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 26</strong></a> - AVL Trees </li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 27</strong></a> - Hashing</li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 28</strong></a> - Graphs and Applications</li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 29</strong></a> - Weighted Graphs and Applications </li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 30</strong></a> - Multithreading and Parallel Programming</li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 31</strong></a> - Networking </li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 32</strong></a> - Java Database Programming</li><br>
-		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 33</strong></a> - Java Server Faces</li><br>
-				
-		
-		
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 22</strong><!--</a>--> - Developing Efficient Algorithms</li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 23</strong><!--</a>--> - Sorting</li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 24</strong><!--</a>--> - Implementing Lists, Stacks, Queues, and Priority Queues</li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 26</strong><!--</a>--> - AVL Trees </li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 27</strong><!--</a>--> - Hashing</li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 28</strong><!--</a>--> - Graphs and Applications</li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 29</strong><!--</a>--> - Weighted Graphs and Applications </li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 30</strong><!--</a>--> - Multithreading and Parallel Programming</li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 31</strong><!--</a>--> - Networking </li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 32</strong><!--</a>--> - Java Database Programming</li><br>
+		<li><!--<a href="https://github.com/HarryDulaney/java-programming-daniel-liang-10th/tree/master/src/">--><strong>Chapter 33</strong><!--</a>--> - Java Server Faces</li><br>
 </ul>

src/ch_03/E0315.java

@@ -25,7 +25,7 @@ public class E0315 {
     public static void main(String[] args) {
 
         int lottery = (int) (Math.random() * 1000);
-        // int lottery = 174; Test
+        // int lottery = 174; Test_E2501
         Scanner input = new Scanner(System.in);
         System.out.print("Enter your lottery pick as an integer of three digits: ");
 
@@ -35,7 +35,7 @@ public static void main(String[] args) {
         int l2 = lottery % 100;
         int l3 = l2 / 10;
         l2 %= 10;
-        // Test
+        // Test_E2501
         System.out.println("l1 = " + l1);
         System.out.println("l2 = " + l2);
         System.out.println("l3 = " + l3);
@@ -44,7 +44,7 @@ public static void main(String[] args) {
         int g2 = guess % 100;
         int g3 = g2 / 10;
         g2 %= 10;
-        // Test
+        // Test_E2501
         System.out.println("g1 = " + g1);
         System.out.println("g2 = " + g2);
         System.out.println("g3 = " + g3);

src/ch_03/E0322.java

@@ -14,7 +14,7 @@
  * less than or equal to 10. The formula for computing the distance is 2(x2 -
  * x1)2 + (y2 - y1)2.
  * <p>
- * (Test your program to cover all cases.) <br>
+ * (Test_E2501 your program to cover all cases.) <br>
  * Two sample runs are
  * shown below.
  * </p>

src/ch_03/E0323.java

@@ -11,7 +11,7 @@
  * (6, 4) is outside the rectangle, as shown in Figure 3.7b.
  * <p>
  * (Hint: A point is in the rectangle if its horizontal distance to (0, 0) is less than or equal to 10 / 2 and its
- * vertical distance to (0, 0) is less than or equal to 5.0 / 2. Test your program to cover all cases.)
+ * vertical distance to (0, 0) is less than or equal to 5.0 / 2. Test_E2501 your program to cover all cases.)
  * <p>
  * Here are two sample runs.
  * <p>

src/ch_03/E0328.java

@@ -7,7 +7,7 @@
  * the user to enter the center x-, y-coordinates, width, and
  * height of two rectangles and determines whether the second
  * rectangle is inside the first or overlaps with the first, as shown
- * in Figure 3.9. Test your program to cover all cases.
+ * in Figure 3.9. Test_E2501 your program to cover all cases.
  *
  * @author Harry Dulaney
  */

src/ch_03/E0329.java

@@ -10,7 +10,7 @@
  * (Hint: circle2 is inside circle1 if the distance between the two centers  <= |r1 - r2|
  * and circle2 overlaps circle1 if the distance between the two centers <= r1 + r2.
  * <p>
- * Test your program to cover all cases.)
+ * Test_E2501 your program to cover all cases.)
  * <p>
  * <p>
  * Enter circle1's center x-, y-coordinates, and radius: 0.5 5.1 13

src/ch_05/E0502.java

@@ -47,7 +47,7 @@ public static void main(String[] args) {
 
 
 	    System.out.println("Correct Count is " + correctCount + 
-	      "\nTest time is " + testTime / 1000 + " seconds\n" + output);
+	      "\nTest_E2501 time is " + testTime / 1000 + " seconds\n" + output);
 
   }
 }

src/ch_07/E0706.java

@@ -23,7 +23,7 @@ public static void main(String[] args) {
         while (count < NUMBER_OF_PRIMES) {
         // Assume the number is prime
             boolean isPrime = true; // Is the current number prime?
-        // Test whether number is prime
+        // Test_E2501 whether number is prime
             for (int divisor = 2; divisor <= number / 2; divisor++) {
                 if (number % divisor == 0) { // If true, number is not prime
                     isPrime = false; // Set isPrime to false

src/ch_07/E0712.java

@@ -17,9 +17,9 @@ public class E0712 {
     public static void main(String[] args) {
         int[] test = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20};
         int[] t1 = new int[10];
-        System.out.println("Test array is: " + Arrays.toString(test));
+        System.out.println("Test_E2501 array is: " + Arrays.toString(test));
         reverse(test);
-        System.out.println("Test array reversed: " + Arrays.toString(test) + "\n");
+        System.out.println("Test_E2501 array reversed: " + Arrays.toString(test) + "\n");
         System.out.println("Enter 10 numbers: ");
         Scanner in = new Scanner(System.in);
         for (int i = 0; i < 10; i++) {

src/ch_08/E0807.java

@@ -5,7 +5,7 @@
  * *8.7 (Points nearest to each other) Listing 8.3 gives a program that finds
  * two points in a two-dimensional space nearest to each other. Revise the
  * program so that it finds two points in a three-dimensional space nearest to
- * each other. Use a two-dimensional array to represent the points. Test the
+ * each other. Use a two-dimensional array to represent the points. Test_E2501 the
  * program using the following points: double[][] points = {{-1, 0, 3}, {-1, -1,
  * -1}, {4, 1, 1}, {2, 0.5, 9}, {3.5, 2, -1}, {3, 1.5, 3}, {-1.5, 4, 2}, {5.5,
  * 4, -0.5}};

src/ch_17/E1706.java

@@ -52,7 +52,7 @@ public static void main(String[] args) {
     }
 
     /**
-     * Test loan objects boolean.
+     * Test_E2501 loan objects boolean.
      *
      * @param loans the loans
      * @param file  the file

src/ch_25/AbstractTree.java

@@ -1,31 +1,29 @@
 package ch_25;
 
 
-public abstract class AbstractTree<E> implements Tree<E>{
+public abstract class AbstractTree<E> implements Tree<E> {
 
 
-	@Override
-	public void inorder() {
-		
-	}
+    @Override
+    public void inorder() {
 
-	@Override
-	public void postorder() {
-		
-	}
+    }
 
-	@Override
-	public void preorder() {
-		
-	}
+    @Override
+    public void postorder() {
 
+    }
+
+    @Override
+    public void preorder() {
+
+    }
+
+
+    @Override
+    public boolean isEmpty() {
+        return getSize() == 0;
+    }
 
-	@Override
-	public boolean isEmpty() {
-		return getSize() == 0;
-	}
-	
-	
-	
 
 }