Refactored and fixed the bugs in BinaryTreeSort
This commit is contained in:
nik
parent
874940160a
commit
65361a4445
@ -1,80 +0,0 @@
|
||||
import java.util.Arrays;
|
||||
public class TreeSort {
|
||||
|
||||
public Node root;
|
||||
|
||||
public TreeSort(Object x) {
|
||||
root = new Node(x);
|
||||
}//end TreeSort constructor
|
||||
|
||||
public Node insert(Node node, Integer x) {
|
||||
if (node == null) {
|
||||
return node = new Node(x);
|
||||
}//end if
|
||||
if (x < (Integer) node.anElement) {
|
||||
node.less = insert(node.less, x);
|
||||
} //end if
|
||||
else {
|
||||
node.greater = insert(node.greater, x);
|
||||
}//end else
|
||||
return node;
|
||||
}//end insert
|
||||
|
||||
|
||||
public Node decimalInsert(Node node, Double x) {
|
||||
if (node == null) {
|
||||
return node = new Node(x);
|
||||
}//end if
|
||||
if (x < (Double) node.anElement) {
|
||||
node.less = decimalInsert(node.less, x);
|
||||
} //end if
|
||||
else {
|
||||
node.greater = decimalInsert(node.greater, x);
|
||||
}//end else
|
||||
return node;
|
||||
}//end insert
|
||||
|
||||
|
||||
public void treeSort(Node node) {
|
||||
if (node != null) {
|
||||
treeSort(node.less);
|
||||
System.out.print(((Object) node.anElement) + ", ");
|
||||
treeSort(node.greater);
|
||||
}//end if
|
||||
}//end TreeSort class
|
||||
|
||||
|
||||
|
||||
public static void main(String args[]) {
|
||||
int[] intArray = {12, 40, 9, 3, 19, 74, 7, 31, 23, 54, 26, 81, 12 };
|
||||
TreeSort ts = new TreeSort(new Integer(intArray[0]));
|
||||
for (int i = 1; i < intArray.length; i++) { //sorts every index of the list one at a time
|
||||
ts.insert(ts.root, new Integer(intArray[i])); //builds on the tree from a root node
|
||||
}//end for
|
||||
System.out.print("Integer Array Sorted in Increasing Order: ");
|
||||
ts.treeSort(ts.root);
|
||||
System.out.println(); //To sort a test array of integers
|
||||
|
||||
Double[] decimalArray = {8.2, 1.5, 3.14159265, 9.3, 5.1, 4.8, 2.6};
|
||||
TreeSort dts = new TreeSort(new Double(decimalArray[0]).doubleValue());
|
||||
for (int i = 1; i < decimalArray.length; i++) { //sorts every index of the list one at a time
|
||||
dts.decimalInsert(dts.root, new Double(decimalArray[i]).doubleValue()); //builds on the tree from a root node
|
||||
}//end for
|
||||
System.out.print("Decimal Array, Sorted in Increasing Order: ");
|
||||
dts.treeSort(dts.root);
|
||||
System.out.println();
|
||||
|
||||
String[] stringArray = {"c", "a", "e", "b","d", "dd","da","zz", "AA", "aa","aB","Hb", "Z"};
|
||||
int last = stringArray.length;
|
||||
Arrays.sort(stringArray); //Uses an imported arrays method to automatically alphabetize
|
||||
System.out.print("String Array Sorted in Alphabetical Order: ");
|
||||
ts.insert(ts.root, last);
|
||||
for(int i=0; i<last; i++){
|
||||
System.out.print(stringArray[i]+"\t");
|
||||
//To sort a test array of strings hard coded in the main method
|
||||
//Please Note that Capital letters always come before lower case
|
||||
//I tried to make the test array show its behavior clearly
|
||||
}//end for
|
||||
}//end Main method
|
||||
}//end TreeSort class
|
||||
|
||||
90
Sorts/src/sort/BinaryTreeSort.java
Normal file
90
Sorts/src/sort/BinaryTreeSort.java
Normal file
@ -0,0 +1,90 @@
|
||||
package sort;
|
||||
|
||||
import static sort.SortUtils.less;
|
||||
import static sort.SortUtils.print;
|
||||
|
||||
|
||||
public class BinaryTreeSort{
|
||||
|
||||
interface TreeVisitor<T extends Comparable<T>> {
|
||||
void visit(Node<T> node);
|
||||
}
|
||||
|
||||
private static class SortVisitor<T extends Comparable<T>> implements TreeVisitor<T> {
|
||||
|
||||
private final T[] array;
|
||||
private int counter;
|
||||
|
||||
SortVisitor(T[] array) {
|
||||
this.array = array;
|
||||
}
|
||||
|
||||
@Override
|
||||
public void visit(Node<T> node) {
|
||||
array[counter++] = node.value;
|
||||
}
|
||||
}
|
||||
|
||||
private static class Node<T extends Comparable<T>>{
|
||||
private T value;
|
||||
private Node<T> left;
|
||||
private Node<T> right;
|
||||
|
||||
Node(T value) {
|
||||
this.value = value;
|
||||
}
|
||||
|
||||
void insert(Node<T> node) {
|
||||
if (less(node.value, value)){
|
||||
if (left != null) left.insert(node);
|
||||
else left = node;
|
||||
}
|
||||
else {
|
||||
if (right != null) right.insert(node);
|
||||
else right = node;
|
||||
}
|
||||
}
|
||||
|
||||
void traverse(TreeVisitor<T> visitor) {
|
||||
if ( left != null)
|
||||
left.traverse(visitor);
|
||||
|
||||
visitor.visit(this);
|
||||
|
||||
if ( right != null )
|
||||
right.traverse(visitor );
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
|
||||
private <T extends Comparable<T>> T[] sort(T[] array) {
|
||||
|
||||
Node<T> root = new Node<>(array[0]);
|
||||
for (int i = 1; i < array.length; i++) {
|
||||
root.insert(new Node<>(array[i]));
|
||||
}
|
||||
|
||||
root.traverse(new SortVisitor<>(array));
|
||||
|
||||
return array;
|
||||
|
||||
}
|
||||
|
||||
|
||||
public static void main(String args[]) {
|
||||
|
||||
Integer[] intArray = {12, 40, 9, 3, 19, 74, 7, 31, 23, 54, 26, 81, 12};
|
||||
BinaryTreeSort treeSort = new BinaryTreeSort();
|
||||
Integer[] sorted = treeSort.sort(intArray);
|
||||
print(sorted);
|
||||
|
||||
Double[] decimalArray = {8.2, 1.5, 3.14159265, 9.3, 5.1, 4.8, 2.6};
|
||||
print(treeSort.sort(decimalArray));
|
||||
|
||||
String[] stringArray = {"c", "a", "e", "b","d", "dd","da","zz", "AA", "aa","aB","Hb", "Z"};
|
||||
print(treeSort.sort(stringArray));
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
Loading…
Reference in New Issue
Block a user