new exercises #1
Description
- exercice BST: the student should collect all the int values in increasing order (use book implem). Answer: use preorder traversal and add it to a linked list
- exercise hash map: implement the remove given a key
you can also regenerate all the exercices with the package names of the repo. warning: the links on inginious must be updated.