Skip to content

Commit ddb10a9

Browse files
liuyuboboboliuyubobobo
committed
BST main test bug fixed.
1 parent edfb5b6 commit ddb10a9

File tree

8 files changed

+8
-8
lines changed
  • 05-Binary-Search-Tree/Course Code (Java)
    • 04-Binary-Search-Tree-Search/src/bobo/algo
    • 05-Binary-Search-Tree-Traverse/src/bobo/algo
    • 06-Binary-Search-Tree-Level-Traverse/src/bobo/algo
    • 07-Binary-Search-Tree-Remove-Min-and-Max/src/bobo/algo
    • 08-Binary-Search-Tree-Remove/src/bobo/algo
    • 10-The-Disadvantages-of-Binary-Search-Tree-and-More-Trees/src/bobo/algo
    • Chapter-05-Completed-Code/src/bobo/algo
    • Optional-05-Floor-and-Ceil-in-BST/src/bobo/algo

8 files changed

+8
-8
lines changed

‎05-Binary-Search-Tree/Course Code (Java)/04-Binary-Search-Tree-Search/src/bobo/algo/BST.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -119,7 +119,7 @@ public static void main(String[] args) {
119119
int pos = (int) (Math.random() * (i+1));
120120
Integer t = arr[pos];
121121
arr[pos] = arr[i];
122-
arr[i] = arr[pos];
122+
arr[i] = t;
123123
}
124124
// 由于我们实现的二分搜索树不是平衡二叉树，
125125
// 所以如果按照顺序插入一组数据，我们的二分搜索树会退化成为一个链表

‎05-Binary-Search-Tree/Course Code (Java)/05-Binary-Search-Tree-Traverse/src/bobo/algo/BST.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -163,7 +163,7 @@ public static void main(String[] args) {
163163
int pos = (int) (Math.random() * (i+1));
164164
Integer t = arr[pos];
165165
arr[pos] = arr[i];
166-
arr[i] = arr[pos];
166+
arr[i] = t;
167167
}
168168
// 由于我们实现的二分搜索树不是平衡二叉树，
169169
// 所以如果按照顺序插入一组数据，我们的二分搜索树会退化成为一个链表

‎05-Binary-Search-Tree/Course Code (Java)/06-Binary-Search-Tree-Level-Traverse/src/bobo/algo/BST.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -185,7 +185,7 @@ public static void main(String[] args) {
185185
int pos = (int) (Math.random() * (i+1));
186186
Integer t = arr[pos];
187187
arr[pos] = arr[i];
188-
arr[i] = arr[pos];
188+
arr[i] = t;
189189
}
190190
// 由于我们实现的二分搜索树不是平衡二叉树，
191191
// 所以如果按照顺序插入一组数据，我们的二分搜索树会退化成为一个链表

‎05-Binary-Search-Tree/Course Code (Java)/07-Binary-Search-Tree-Remove-Min-and-Max/src/bobo/algo/BST.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -259,7 +259,7 @@ public static void main(String[] args) {
259259
int pos = (int) (Math.random() * (i+1));
260260
Integer t = arr[pos];
261261
arr[pos] = arr[i];
262-
arr[i] = arr[pos];
262+
arr[i] = t;
263263
}
264264
// 由于我们实现的二分搜索树不是平衡二叉树，
265265
// 所以如果按照顺序插入一组数据，我们的二分搜索树会退化成为一个链表

‎05-Binary-Search-Tree/Course Code (Java)/08-Binary-Search-Tree-Remove/src/bobo/algo/BST.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -321,7 +321,7 @@ public static void main(String[] args) {
321321
int pos = (int) (Math.random() * (i+1));
322322
Integer t = arr[pos];
323323
arr[pos] = arr[i];
324-
arr[i] = arr[pos];
324+
arr[i] = t;
325325
}
326326
// 由于我们实现的二分搜索树不是平衡二叉树，
327327
// 所以如果按照顺序插入一组数据，我们的二分搜索树会退化成为一个链表

‎05-Binary-Search-Tree/Course Code (Java)/10-The-Disadvantages-of-Binary-Search-Tree-and-More-Trees/src/bobo/algo/BST.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -321,7 +321,7 @@ public static void main(String[] args) {
321321
int pos = (int) (Math.random() * (i+1));
322322
Integer t = arr[pos];
323323
arr[pos] = arr[i];
324-
arr[i] = arr[pos];
324+
arr[i] = t;
325325
}
326326
// 由于我们实现的二分搜索树不是平衡二叉树，
327327
// 所以如果按照顺序插入一组数据，我们的二分搜索树会退化成为一个链表

‎05-Binary-Search-Tree/Course Code (Java)/Chapter-05-Completed-Code/src/bobo/algo/BST.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -321,7 +321,7 @@ public static void main(String[] args) {
321321
int pos = (int) (Math.random() * (i+1));
322322
Integer t = arr[pos];
323323
arr[pos] = arr[i];
324-
arr[i] = arr[pos];
324+
arr[i] = t;
325325
}
326326
// 由于我们实现的二分搜索树不是平衡二叉树，
327327
// 所以如果按照顺序插入一组数据，我们的二分搜索树会退化成为一个链表

‎05-Binary-Search-Tree/Course Code (Java)/Optional-05-Floor-and-Ceil-in-BST/src/bobo/algo/BST.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -396,7 +396,7 @@ public static void main(String[] args) {
396396
int pos = (int) (Math.random() * (i+1));
397397
Integer t = arr[pos];
398398
arr[pos] = arr[i];
399-
arr[i] = arr[pos];
399+
arr[i] = t;
400400
}
401401
// 由于我们实现的二分搜索树不是平衡二叉树，
402402
// 所以如果按照顺序插入一组数据，我们的二分搜索树会退化成为一个链表

0 commit comments

Comments
 (0)