Fixed info in README of tests

README.md

@@ -6,7 +6,7 @@
 [![Build Status](https://travis-ci.org/nbro/ands.svg?branch=master)](https://travis-ci.org/nbro/ands)
 [![Coverage Status](https://coveralls.io/repos/github/nbro/ands/badge.svg)](https://coveralls.io/github/nbro/ands)
 [![Codacy Badge](https://api.codacy.com/project/badge/Grade/c88538816f424aea916c251428f78c0a)](https://www.codacy.com/app/nbro/ands?utm_source=github.com&utm_medium=referral&utm_content=dossan/ands&utm_campaign=Badge_Grade)
-[![Packagist](https://img.shields.io/packagist/l/doctrine/orm.svg?maxAge=2592000)](./LICENSE)
+[![Packagist](https://img.shields.io/packagist/l/doctrine/orm.svg?maxAge=2592000)](./LICENSE.md)
 [![Join the chat at https://gitter.im/ands-project/Lobby](https://badges.gitter.im/ands-project/Lobby.svg)](https://gitter.im/ands-project/Lobby?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
 
 
@@ -27,7 +27,7 @@ You will also find some algorithms related to some particular _design paradigm_,
 
 - This is a **work in progress**, don't expect to find here all the data structures and algorithms you're searching. Consider to contribute to the quality and size of the project.
 
-- Again, **mistakes are possible**, even if decent tests are starting to being done. You can find them under the folder [`tests`](tests). So, as the [license](LICENSE) says, this project is provided "as is", etc.
+- Again, **mistakes are possible**, even if decent tests are starting to being done. You can find them under the folder [`tests`](tests). So, as the [license](LICENSE.md) says, this project is provided "as is", etc.
 
 - **No optimisation** has been done to any algorithm or data structure. The purpose of the implementations is just for **_exposition of the concepts_**!
 

tests/README.md

@@ -2,9 +2,6 @@
 
 ## TODO
 
-- TST
+- Refactor all tests for the data structures except for Queue, DSForests, TST (which, as all others, may nonetheless need to be improved)
 
-## To refactor
-
-- All tests for the data structures except for Queue.
-- forward Euler method
+- Improve the tests for the forward Euler method