We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent aa4c1db commit c3a46ecCopy full SHA for c3a46ec
1 file changed
src/main/java/com/thealgorithms/sorts/BinaryTreeSort.java
@@ -27,19 +27,19 @@ public <T extends Comparable<T>> T[] sort(T[] array) {
27
if (array == null || array.length <= 1) {
28
return array;
29
}
30
-
+
31
TreeNode<T> root = null;
32
for (T value : array) {
33
root = insert(root, value);
34
35
36
List<T> result = new ArrayList<>();
37
inorder(root, result);
38
39
for (int i = 0; i < array.length; i++) {
40
array[i] = result.get(i);
41
42
43
44
45
0 commit comments