package binary_search_tree;

import binary_search_tree.Bst;	// My implementation of Binary Search Tree in package binary_search_tree

/*
	Class to test class Bst. (Binary Search Tree)
*/

class TestBst{

			

	// Tests Insertion
	public static void testInsertion(){

		// Create a bst object
		Bst bst = new Bst();

		// Create array of integers to insert
		int[] values = {10, 7, 9, 8, 2, 15, 13, 17};

		// Insert values into bst
		for(int v: values){
			bst.insert(v);
		}

		// Print In Order traversal
		System.out.print("Inorder Traversal:\t ");
		bst.inOrder();

		System.out.println();
		System.out.println("Should be:\t\t 2 7 8 9 10 13 15 17");

	}



	public static void main(String args[]){

		// Test Insertion
		testInsertion();
	}

}

@@ -22,16 +22,57 @@
 _tree;%0A%0A
+import java.util.NoSuchElementException;%0A
 import b
@@ -350,16 +350,173 @@
 Bst();%0A%0A
+%09%09// Test inorder when tree is empty. Should throw exception%0A%09%09try%7B%0A%09%09%09bst.inOrder();%0A%09%09%7D%0A%09%09catch(NoSuchElementException e)%7B%0A%09%09%09System.out.println(e);%0A%09%09%7D%0A%0A%0A
 %09%09// Cre

Add test case to check inOrder when tree is empty. Throws NoSuchElement exception