human
Write me a code to delete alternate nodes of a Linked List and the other steps required given the following:
Delete alternate nodes of a Linked List | deletes alternate nodes of a list starting with head.
Change the next link of head.
Recursively call for the new next of head"
Solution in Python:
assistant
#Here is code to delete alternate nodes of a Linked List and the other steps required.
 def deleteAlt ( head ) :
	if ( head == None ) :
		return
	node = head . next
	if ( node == None ) :
		return
	head . next = node . next
	deleteAlt ( head . next )