Sure, here is a simple Python program that creates a doubly linked list, inserts a node at the first position, and traverses the list in reverse order.

```python
class Node:
def __init__(self, data=None):
self.data = data
self.next = None
self.prev = None

class DoublyLinkedList:
def __init__(self):
self.head = None

def insert_first(self, data):
node = Node(data)
if self.head is not None:
self.head.prev = node
node.next = self.head
self.head = node

def reverse_traverse(self):
temp = self.head
while temp.next is not None:
temp = temp.next
while temp is not None:
print(temp.data, end=' ')
temp = temp.prev

# Test the program
dll = DoublyLinkedList()
dll.insert_first(10)
dll.insert_first(20)
dll.insert_first(30)
dll.reverse_traverse() # Output: 10 20 30
```

In this program, we first define a `Node` class that will be used to create new nodes. Each node has a `data` attribute to hold the data and `next` and `prev` attributes to point to the next and previous nodes in the list.

We then define a `DoublyLinkedList` class that has a `head` attribute to keep track of the first node in the list. The `insert_first` method creates a new node and inserts it at the beginning of the list. The `reverse_traverse` method starts from the end of the list and traverses it in reverse order, printing the data in each node.

Question

Sure, here is a simple Python program that creates a doubly linked list, inserts a node at the first position, and traverses the list in reverse order.

```python
class Node:
    def __init__(self, data=None):
        self.data = data
        self.next = None
        self.prev = None

class DoublyLinkedList:
    def __init__(self):
        self.head = None

def insert_first(self, data):
        node = Node(data)
        if self.head is not None:
            self.head.prev = node
            node.next = self.head
        self.head = node

def reverse_traverse(self):
        temp = self.head
        while temp.next is not None:
            temp = temp.next
        while temp is not None:
            print(temp.data, end=' ')
            temp = temp.prev

# Test the program
dll = DoublyLinkedList()
dll.insert_first(10)
dll.insert_first(20)
dll.insert_first(30)
dll.reverse_traverse()  # Output: 10 20 30
```

In this program, we first define a `Node` class that will be used to create new nodes. Each node has a `data` attribute to hold the data and `next` and `prev` attributes to point to the next and previous nodes in the list.

We then define a `DoublyLinkedList` class that has a `head` attribute to keep track of the first node in the list. The `insert_first` method creates a new node and inserts it at the beginning of the list. The `reverse_traverse` method starts from the end of the list and traverses it in reverse order, printing the data in each node.

Knowee AI · Accepted Answer