jimmy17x
diff --git a/‎bin/ClassicDataStructures/BTreeExercise.class
881 Bytes b/‎bin/ClassicDataStructures/BTreeExercise.class
881 Bytes
diff --git a/‎bin/ClassicDataStructures/BinarySearchTree.class
1.64 KB b/‎bin/ClassicDataStructures/BinarySearchTree.class
1.64 KB
diff --git a/‎bin/ClassicDataStructures/ExerciseConvertDecimalToBinary.class
1.51 KB b/‎bin/ClassicDataStructures/ExerciseConvertDecimalToBinary.class
1.51 KB
diff --git a/‎bin/ClassicDataStructures/LinkedListNameQueue.class
1.66 KB b/‎bin/ClassicDataStructures/LinkedListNameQueue.class
1.66 KB
diff --git a/‎bin/ClassicDataStructures/NodeBinaryTree.class
599 Bytes b/‎bin/ClassicDataStructures/NodeBinaryTree.class
599 Bytes
diff --git a/‎bin/ClassicDataStructures/RadixSort.class
2.33 KB b/‎bin/ClassicDataStructures/RadixSort.class
2.33 KB
diff --git a/‎bin/ClassicDataStructures/StackExample.class
1.27 KB b/‎bin/ClassicDataStructures/StackExample.class
1.27 KB
diff --git a/‎bin/sequentialCollection/AlphaTreeSet.class
22 Bytes b/‎bin/sequentialCollection/AlphaTreeSet.class
22 Bytes
diff --git a/‎bin/sequentialCollection/NamesHashSet.class
54 Bytes b/‎bin/sequentialCollection/NamesHashSet.class
54 Bytes
diff --git a/‎src/ClassicDataStructures/BTreeExercise.java
Lines changed: 27 additions & 0 deletions b/‎src/ClassicDataStructures/BTreeExercise.java
Lines changed: 27 additions & 0 deletions
@@ -0,0 +1,27 @@
+package ClassicDataStructures;
+
+public class BTreeExercise {
+
+
+	public static void main(String[] args) {
+		BinarySearchTree bst = new BinarySearchTree();
+		bst.insert(8);
+		bst.insert(7);
+		bst.insert(13);
+		bst.insert(3);
+		bst.insert(10);
+		bst.insert(6);
+		bst.insert(4);
+		bst.insert(1);
+		bst.insert(14);
+		
+		//bst.inOrder();
+		bst.preOrder();
+		System.out.println();
+		System.out.println(bst.min());
+		System.out.println(bst.max());
+		
+		 
+	}
+
+}