RosettaCodeData/Task/Doubly-linked-list-Traversal/PascalABC.NET/doubly-linked-list-traversal.pas

begin
  var lst := new LinkedList<integer>(1..10);
  var current := lst.First;
  while current <> nil do
  begin
    Print(current.Value);
    current := current.Next;
  end;
end.