Initial data commit

Task/Singly-linked-list-Element-insertion/Pascal/singly-linked-list-element-insertion-1.pas

@@ -0,0 +1,15 @@
+type
+  pCharNode = ^CharNode;
+  CharNode = record
+               data: char;
+               next: pCharNode;
+             end;
+
+(* This procedure inserts a node (newnode) directly after another node which is assumed to already be in a list.
+  It does not allocate a new node, but takes an already allocated node, thus allowing to use it (together with
+  a procedure to remove a node from a list) for splicing a node from one list to another. *)
+procedure InsertAfter(listnode, newnode: pCharNode);
+begin
+  newnode^.next := listnode^.next;
+  listnode^.next := newnode;
+end;

Task/Singly-linked-list-Element-insertion/Pascal/singly-linked-list-element-insertion-2.pas

@@ -0,0 +1,27 @@
+var
+  A, B: pCharNode;
+begin
+  (* build the two-component list A->C manually *)
+  new(A);
+  A^.data := 'A';
+  new(A^.next);
+  A^.next^.data := 'C';
+  A^.next^.next := nil;
+
+  (* create the node to be inserted. The initialization of B^.next isn't strictly necessary
+    (it gets overwritten anyway), but it's good style not to leave any values undefined. *)
+  new(B);
+  node^.data := 'B';
+  node^.next := nil;
+
+  (* call the above procedure to insert node B after node A *)
+  InsertAfter(A, B);
+
+  (* delete the list *)
+  while A <> nil do
+   begin
+    B := A;
+    A := A^.next;
+    dispose(B);
+   end
+end.