Consider the following basic algorithms written in Ada: record DoublyLinkedNode { next // A reference to the next node prev // A reference to the previous node data // Data or a reference to data } record DoublyLinkedList { DoublyLinkedNode firstNode // points to first node of list DoublyLinkedNode lastNode // points to last node of list } Traversal of a doubly linked list can be in either direction.
Размотрите следеће основне алгоритме написане у Ади: record DoublyLinkedNode { prev // A reference to the previous node next // A reference to the next node data // Data or a reference to data } record DoublyLinkedList { DoublyLinkedNode firstNode // points to first node of list DoublyLinkedNode lastNode // points to last node of list } Прелажење двоструко повезане листе може да се одвија у било ком правцу.