BST test codes bug fixed.

WorriesL · Nov 14, 2017 · 224f13f · 224f13f
1 parent b624010
commit 224f13f
Show file tree

Hide file tree

Showing 7 changed files with 7 additions and 7 deletions.
diff --git a/05-Binary-Search-Tree/Course Code (Java)/04-Binary-Search-Tree-Search/src/bobo/algo/BST.java b/05-Binary-Search-Tree/Course Code (Java)/04-Binary-Search-Tree-Search/src/bobo/algo/BST.java
@@ -140,7 +140,7 @@ public static void main(String[] args) {
         for(int i = 0 ; i < 2*N ; i ++){
             String res = bst.search(new Integer(i));
             if( i < N )
-                assert res == Integer.toString(i);
+                assert res.equals(Integer.toString(i));
             else
                 assert res == null;
         }

diff --git a/...nary-Search-Tree/Course Code (Java)/05-Binary-Search-Tree-Traverse/src/bobo/algo/BST.java b/...nary-Search-Tree/Course Code (Java)/05-Binary-Search-Tree-Traverse/src/bobo/algo/BST.java
@@ -184,7 +184,7 @@ public static void main(String[] args) {
         for(int i = 0 ; i < 2*N ; i ++){
             String res = bst.search(new Integer(i));
             if( i < N )
-                assert res == Integer.toString(i);
+                assert res.equals(Integer.toString(i));
             else
                 assert res == null;
         }

diff --git a/...earch-Tree/Course Code (Java)/06-Binary-Search-Tree-Level-Traverse/src/bobo/algo/BST.java b/...earch-Tree/Course Code (Java)/06-Binary-Search-Tree-Level-Traverse/src/bobo/algo/BST.java
@@ -206,7 +206,7 @@ public static void main(String[] args) {
         for(int i = 0 ; i < 2*N ; i ++){
             String res = bst.search(new Integer(i));
             if( i < N )
-                assert res == Integer.toString(i);
+                assert res.equals(Integer.toString(i));
             else
                 assert res == null;
         }

diff --git a/...h-Tree/Course Code (Java)/07-Binary-Search-Tree-Remove-Min-and-Max/src/bobo/algo/BST.java b/...h-Tree/Course Code (Java)/07-Binary-Search-Tree-Remove-Min-and-Max/src/bobo/algo/BST.java
@@ -280,7 +280,7 @@ public static void main(String[] args) {
         for(int i = 0 ; i < 2*N ; i ++){
             String res = bst.search(new Integer(i));
             if( i < N )
-                assert res == Integer.toString(i);
+                assert res.equals(Integer.toString(i));
             else
                 assert res == null;
         }

diff --git a/05-Binary-Search-Tree/Course Code (Java)/08-Binary-Search-Tree-Remove/src/bobo/algo/BST.java b/05-Binary-Search-Tree/Course Code (Java)/08-Binary-Search-Tree-Remove/src/bobo/algo/BST.java
@@ -342,7 +342,7 @@ public static void main(String[] args) {
         for(int i = 0 ; i < 2*N ; i ++){
             String res = bst.search(new Integer(i));
             if( i < N )
-                assert res == Integer.toString(i);
+                assert res.equals(Integer.toString(i));
             else
                 assert res == null;
         }

diff --git a/...e (Java)/10-The-Disadvantages-of-Binary-Search-Tree-and-More-Trees/src/bobo/algo/BST.java b/...e (Java)/10-The-Disadvantages-of-Binary-Search-Tree-and-More-Trees/src/bobo/algo/BST.java
@@ -342,7 +342,7 @@ public static void main(String[] args) {
         for(int i = 0 ; i < 2*N ; i ++){
             String res = bst.search(new Integer(i));
             if( i < N )
-                assert res == Integer.toString(i);
+                assert res.equals(Integer.toString(i));
             else
                 assert res == null;
         }

diff --git a/05-Binary-Search-Tree/Course Code (Java)/Chapter-05-Completed-Code/src/bobo/algo/BST.java b/05-Binary-Search-Tree/Course Code (Java)/Chapter-05-Completed-Code/src/bobo/algo/BST.java
@@ -342,7 +342,7 @@ public static void main(String[] args) {
         for(int i = 0 ; i < 2*N ; i ++){
             String res = bst.search(new Integer(i));
             if( i < N )
-                assert res == Integer.toString(i);
+                assert res.equals(Integer.toString(i));
             else
                 assert res == null;
         }