@@ -0,0 +1,1193 @@
+package comp2402a5;%0A%0Apublic class BinaryTreeTest %7B%0A%0A%09public static void main(String%5B%5D args) %7B%0A%09%09BinaryTree tree = new BinaryTree(5);%0A%09%09tree.r.left = new Node(6);%0A%09%09tree.r.right = new Node(7);%0A%09%09%0A%09%09tree.r.left.left = new Node(8);%0A%09%09tree.r.left.left.left = tree.nil;%0A%09%09tree.r.left.left.right = tree.nil;%0A%09%09%0A%09%09tree.r.left.right = new Node(9);%0A%09%09%0A%09%09tree.r.left.right.left = new Node(12);%0A%09%09tree.r.left.right.right = new Node(13);%0A%09%09tree.r.left.right.left.left = tree.nil;%0A%09%09tree.r.left.right.left.right = tree.nil;%0A%09%09tree.r.left.right.right.left = tree.nil;%0A%09%09tree.r.left.right.right.right = tree.nil;%0A%09%09%0A%09%09tree.r.right.left = new Node(10);%0A%09%09tree.r.right.left.right = tree.nil;%0A%09%09tree.r.right.right = new Node(11);%0A%09%09%0A%09%09tree.r.right.left.left = new Node(14);%0A%09%09tree.r.right.right.left = new Node(15);%0A%09%09tree.r.right.right.left.left = tree.nil;%0A%09%09tree.r.right.right.left.right = tree.nil;%0A%09%09tree.r.right.right.right = new Node(16);%0A%09%09tree.r.right.right.right.left = tree.nil;%0A%09%09tree.r.right.right.right.right = tree.nil;%0A%09%09%0A%09%09tree.r.right.left.left.left = tree.nil;%0A%09%09tree.r.right.left.left.right = tree.nil;%0A%09%09%0A%09%09%0A%09%09tree.inOrderNumbersNonRecursive();%0A%09%09System.out.println(tree.r.inorderN);%0A%09%7D%0A%0A%7D%0A

Create BinaryTreeTest class