human
What is a code to deletion at different positions in a Circular Linked List and the other steps required given the following:
Deletion at different positions in a Circular Linked List | Function to delete last node of Circular Linked List.
check if list doesn 't have any node  if not then return.
check if list have single node if yes then delete it and return.
move first node to last previous"
How can the above be solved in Python?
assistant
#Here is code to deletion at different positions in a Circular Linked List and the other steps required.
 def DeleteLast ( head ) :
	current = head
	temp = head
	previous = None
	if ( head == None ) :
		print ( " List is empty " )
		return None
	if ( current . next == current ) :
		head = None
		return None
	while ( current . next != head ) :
		previous = current
		current = current . next
	previous . next = current . next
	head = previous . next
	return head