unittests from makefile is done

highscores.txt

@@ -3,6 +3,7 @@ Regis;18924
 player_name;9929
 Kamto;7946
 player_name;5987
+player_1;4989
 Warren;4986
 player_name;4983
 player1;3999

makefile

@@ -35,8 +35,20 @@ $(program_obj_filesobj_files): %.o: %.c
 # --------------------------
 # Unit Tests
 # --------------------------
-unitTests:
-	echo "needs to be implemented"
+
+unitTests: test_numbers test_stack
+
+test_numbers: test_numbers.o stack.o bintree.o numbers.o
+	$(CC) $(FLAGS) $^ -o test_numbers
+
+test_numbers.o: test_numbers.c
+	$(CC) -c $(FLAGS) $< -o $@
+
+test_stack: test_stack.o stack.o
+	$(CC) $(FLAGS) $^ -o test_stack
+
+test_stack.o:  test_stack.c
+	$(CC) -c $(FLAGS) $< -o $@
 
 # --------------------------
 # Clean

numbers.c

@@ -15,6 +15,7 @@
 // Returns NULL on errors. Use your implementation of the binary search tree to check for possible duplicates while
 // creating random numbers.
 unsigned int *createNumbers(unsigned int len) {
+
     if (len < 2)
       return NULL;
 
@@ -52,6 +53,7 @@ unsigned int *createNumbers(unsigned int len) {
 
 // Returns only the only number in numbers which is present twice. Returns zero on errors.
 unsigned int getDuplicate(const unsigned int numbers[], unsigned int len) {
+
     if (!numbers || len < 2) return 0;
 
     // Kopie erstellen, damit Original nicht verändert wird