37 lines
1.1 KiB
Java
37 lines
1.1 KiB
Java
public class Main {
|
|
public static void main(String[] args) {
|
|
BinaryTree binaryTree = new BinaryTree(5);
|
|
binaryTree.insert(2);
|
|
binaryTree.insert(1);
|
|
binaryTree.insert(4);
|
|
binaryTree.insert(3);
|
|
binaryTree.insert(9);
|
|
binaryTree.insert(6);
|
|
binaryTree.insert(15);
|
|
binaryTree.insert(11);
|
|
binaryTree.insert(10);
|
|
binaryTree.insert(13);
|
|
binaryTree.insert(16);
|
|
|
|
//binaryTree.print();
|
|
|
|
// System.out.println(binaryTree.search(42));
|
|
// Test values not in tree
|
|
// System.out.println(binaryTree.search(2));
|
|
|
|
// binaryTree.remove(23);
|
|
// binaryTree.remove(1);
|
|
// binaryTree.remove(9);
|
|
// binaryTree.remove(72);
|
|
// binaryTree.remove(42);
|
|
|
|
System.out.println("------ TRAVERSE ------");
|
|
System.out.print(" [Post Order]:");
|
|
binaryTree.traversePostOrder(binaryTree.getRoot());
|
|
System.out.print("\n [Pre Order]: ");
|
|
binaryTree.traversePreOrder(binaryTree.getRoot());
|
|
System.out.print("\n [In Order]: ");
|
|
binaryTree.traverseInOrder(binaryTree.getRoot());
|
|
}
|
|
}
|