[Python3] Easy to understand || Recurrsion || faster then 98%
\nclass Solution:\n    def deleteDuplicates(self, head: Optional[ListNode]) -> Optional[ListNode]:\n\n\tif not head:\n\t\treturn head\n\n\tif not head.next:\n\t
```\nclass Solution:\n    def deleteDuplicates(self, head: Optional[ListNode]) -> Optional[ListNode]:\n\n\tif not head:\n\t\treturn head\n\n\tif not head.next:\n\t\treturn head\n\n\tif head.val != head.next.val:\n\t\thead.next = self.deleteDuplicates(head.next)\n\t\treturn head\n\n\tif not head.next.next or head.next.val != head.next.next.val:\n\t\treturn self.deleteDuplicates(head.next.next)\n\n\n\treturn self.deleteDuplicates(head.next) \n```\n\n![image](https://assets.leetcode.com/users/images/18cd6f3e-253d-4785-8a74-937a33da5d5b_1642746179.505114.png)\n
['Recursion', 'Python', 'Python3']