Yes @kunal given answer is correct. Now consider you deleted last node. Then how will you set tail pointer to node which comes before the one you deleted???
Remeber it is singly linked list you can go only forward. So for setting tail pointer correctly you have to travese all nodes, which gives O(n) for deleting last node.