35 lines
1.2 KiB
Java
35 lines
1.2 KiB
Java
public class Main {
|
|
public static void main(String[] args) {
|
|
BinaryTree binaryTree = new BinaryTree(23);
|
|
binaryTree.insert(42);
|
|
binaryTree.insert(23);
|
|
binaryTree.insert(22);
|
|
binaryTree.insert(23);
|
|
binaryTree.insert(55);
|
|
binaryTree.insert(72);
|
|
binaryTree.insert(1);
|
|
binaryTree.insert(7);
|
|
binaryTree.insert(3);
|
|
binaryTree.insert(8);
|
|
binaryTree.insert(16);
|
|
|
|
|
|
System.out.println(binaryTree.search(42));
|
|
System.out.println(binaryTree.search(23));
|
|
System.out.println(binaryTree.search(22));
|
|
System.out.println(binaryTree.search(23));
|
|
System.out.println(binaryTree.search(55));
|
|
System.out.println(binaryTree.search(72));
|
|
System.out.println(binaryTree.search(1));
|
|
System.out.println(binaryTree.search(7));
|
|
System.out.println(binaryTree.search(3));
|
|
System.out.println(binaryTree.search(8));
|
|
System.out.println(binaryTree.search(16));
|
|
|
|
// Test values not in tree
|
|
System.out.println(binaryTree.search(2));
|
|
System.out.println(binaryTree.search(44));
|
|
System.out.println(binaryTree.search(100));
|
|
}
|
|
}
|