Create README.md

basicDataStructure
==================
implement a simple single linkedlist
addtoTail(int n) //add a new Node to tail
insertFront(int n) // insert a new Node at the front of linkedlist
delete(int n) //delete a given Node.data
reverse()     //reverse the linkedlist
print()       //print the linkedlist

====================
Need to further implement a reverse using recursion :)