Implementation of Deque using Doubly Linked List in Python

class Node:
    def __init__(self, key):
        self.key = key
        self.next = None
        self.prev = None

class Node:
    def __init__(self, key):
        self.key = key
        self.next = None
        self.prev = None

class MyDeque:
    def __init__(self):
        self.front = None
        self.rear = None
        self.size = 0

    def insert_rear(self, x):
        temp = Node(x)
        if self.rear is None:
            self.front = self.rear = temp
        else:
            self.rear.next = temp
            temp.prev = self.rear
            self.rear = temp
        self.size += 1

    def delete_front(self):
        if self.front is None:
            return None
        else: 
            res = self.front.key
            self.front = self.front.next

            if self.front is None:
                self.rear = None
            else:
                self.front.prev = None

            self.size -= 1
            return res

    def get_size(self):
        return self.size

    def is_empty(self):
        return self.size == 0

    def display(self):
        temp = self.front
        elements = []
        while temp:
            elements.append(temp.key)
            temp = temp.next
        return elements

# Example Usage
dq = MyDeque()
dq.insert_rear(10)
dq.insert_rear(20)
dq.insert_rear(30)
print("Deque after insertions:", dq.display())
print("Deleted from front:", dq.delete_front())
print("Deque after deletion:", dq.display())