human
Doubly Linked List | Set 1 ( Introduction and Insertion ) | Adding a node at the front of the list.
1 & 2 : Allocate the Node & Put in the data.
3. Make next of new node as head and previous as NULL.
4. change prev of head node to new node.
5. move the head to point to the new node"
How can the above be solved in Python?

What is a code to doubly Linked List and the other steps required?
assistant
#Here is code to doubly Linked List and the other steps required.
 def push ( self , new_data ) :
	new_node = Node ( data = new_data )
	new_node . next = self . head
	new_node . prev = None
	if self . head is not None :
		self . head . prev = new_node
	self . head = new_node