فهرست پیوندی دوطرفه

                                        record {
 prev ''// A reference to the previous node''
 next ''// A reference to the next node''
 data ''// Data or a reference to data''
  {

                                        record {
      ''DoublyLinkedNode'' firstNode   ''// points to first node of list''
       ''DoublyLinkedNode'' lastNode    ''// points to last node of list''
  {

 node  := list.firstNode
  '''while''' node ≠ '''null'''
      <do something with node.data>
      node  := node.next

''به سمت عقب''
 node  := list.lastNode
  '''while''' node ≠ '''null'''
      <do something with node.data>
      node  := node.prev

 '''function''' insertAfter(''List'' list, ''Node'' node, ''Node'' newNode)
      newNode.prev  := node
      newNode.next  := node.next
      '''if''' node.next == null'''
          list.lastNode  := newNode
      '''else'''
          node.next.prev  := newNode
      node.next  := newNode

 '''function''' insertBefore(''List'' list, ''Node'' node, ''Node'' newNode)
      newNode.prev  := node.prev
      newNode.next  := node
      '''if''' node.prev == null'''
          list.firstNode  := newNode
      '''else'''
          node.prev.next  := newNode
      node.prev  := newNode

 '''function''' insertBeginning(''List'' list, ''Node'' newNode)
      '''if''' list.firstNode == null'''
          list.firstNode  := newNode
          list.lastNode   := newNode
          newNode.prev  := null
          newNode.next  := null
      '''else'''
          insertBefore(list, list.firstNode, newNode)

 '''function''' insertEnd(''List'' list, ''Node'' newNode)
      '''if''' list.lastNode == null'''
          insertBeginning(list, newNode)
      '''else'''
          insertAfter(list, list.lastNode, newNode)

 '''function''' remove(''List'' list, ''Node'' node)
    '''if''' node.prev == null'''
        list.firstNode  := node.next
    '''else'''
        node.prev.next  := node.next
    '''if''' node.next == null'''
        list.lastNode  := node.prev
    '''else'''
        node.next.prev  := node.prev
    '''destroy''' node

 node  := someNode
  '''do'''
      do something with node.value
      node  := node.next
  '''while''' node ≠ someNode

''به سمت عقب''
 node  := someNode
  '''do'''
      do something with node.value
      node  := node.prev
  '''while''' node ≠ someNode

 '''function''' insertAfter(''Node'' node, ''Node'' newNode)
      newNode.next  := node.next
      newNode.prev  := node
      node.next.prev  := newNode
      node.next       := newNode

 '''function''' insertEnd(''List'' list, ''Node'' node)
      '''if''' list.lastNode == null'''
          node.prev := node
          node.next := node
      '''else'''
          insertAfter(list.lastNode, node)
      list.lastNode := node

 '''function''' remove(''List'' list, ''Node'' node)
      '''if''' node.next == node
          list.lastNode := ''null''
      '''else'''
          node.next.prev := node.prev
          node.prev.next := node.next
          '''if''' node == list.lastNode
              list.lastNode := node.prev;
      '''destroy''' node

 '''function''' insertBefore(''Node'' node, ''Node'' newNode)
      '''if''' node.prev == null'''
           '''error''' "The node is not in a list"
      newNode.prev  := node.prev
      atAddress(newNode.prev)  := newNode
      newNode.next  := node
      node.prev = addressOf(newNode.next)

 '''function''' insertAfter(''Node'' node, ''Node'' newNode)
      newNode.next  := node.next
      '''if''' newNode.next != '''null'''
          newNode.next.prev = addressOf(newNode.next)
      node.next  := newNode
      newNode.prev  := addressOf(node.next)

 '''function''' remove(''Node'' node)
      atAddress(node.prev)  := node.next
      '''if''' node.next != '''null'''
          node.next.prev = node.prev
      '''destroy''' node