<reponame>AmrMKayid/KayAlgo<gh_stars>1-10
class Node:

  def __init__(self, data):
    self.data = data
    self.next = None
    self.prev = None


class DoublyLinkedList:

  def __init__(self):
    self.head = None

  def push(self, new_data):

    new_node = Node(new_data)

    new_node.next = self.head

    if self.head is not None:
      self.head.prev = new_node

    self.head = new_node

  def insert_after(self, prev_node, new_data):

    if prev_node is None:
      print("the given previous node cannot be NULL")
      return

    new_node = Node(new_data)

    new_node.next = prev_node.next

    prev_node.next = new_node

    new_node.prev = prev_node

    if new_node.next is not None:
      new_node.next.prev = new_node

  def append(self, new_data):

    new_node = Node(new_data)

    new_node.next = None

    if self.head is None:
      new_node.prev = None
      self.head = new_node
      return

    last = self.head
    while (last.next is not None):
      last = last.next

    last.next = new_node

    new_node.prev = last

    return

  def print_list(self, node):

    print("\nTraversal in forward direction")
    while node is not None:
      print(" % d" % (node.data), end='')
      last = node
      node = node.next

    print("\nTraversal in reverse direction")
    while last is not None:
      print(" % d" % (last.data), end='')
      last = last.prev


if __name__ == '__main__':
  doubly_linked_list = DoublyLinkedList()

  doubly_linked_list.append(6)

  doubly_linked_list.push(7)

  doubly_linked_list.push(1)

  doubly_linked_list.append(4)

  doubly_linked_list.insert_after(doubly_linked_list.head.next, 8)

  print("Created DLL is: ", end='')
  doubly_linked_list.print_list(doubly_linked_list.head)

class Node:

  def __init__(self, data):
    self.data = data
    self.next = None
    self.prev = None


class DoublyLinkedList:

  def __init__(self):
    self.head = None

  def push(self, new_data):

    new_node = Node(new_data)

    new_node.next = self.head

    if self.head is not None:
      self.head.prev = new_node

    self.head = new_node

  def insert_after(self, prev_node, new_data):

    if prev_node is None:
      print("the given previous node cannot be NULL")
      return

    new_node = Node(new_data)

    new_node.next = prev_node.next

    prev_node.next = new_node

    new_node.prev = prev_node

    if new_node.next is not None:
      new_node.next.prev = new_node

  def append(self, new_data):

    new_node = Node(new_data)

    new_node.next = None

    if self.head is None:
      new_node.prev = None
      self.head = new_node
      return

    last = self.head
    while (last.next is not None):
      last = last.next

    last.next = new_node

    new_node.prev = last

    return

  def print_list(self, node):

    print("\nTraversal in forward direction")
    while node is not None:
      print(" % d" % (node.data), end='')
      last = node
      node = node.next

    print("\nTraversal in reverse direction")
    while last is not None:
      print(" % d" % (last.data), end='')
      last = last.prev


if __name__ == '__main__':
  doubly_linked_list = DoublyLinkedList()

  doubly_linked_list.append(6)

  doubly_linked_list.push(7)

  doubly_linked_list.push(1)

  doubly_linked_list.append(4)

  doubly_linked_list.insert_after(doubly_linked_list.head.next, 8)

  print("Created DLL is: ", end='')
  doubly_linked_list.print_list(doubly_linked_list.head)