Напиши структуру данных skip list (список с пропусками) на языке pascal. Не забудь оформить процедуры добавления элемента, удаления элемента, поиска элемента и вывода всей структуры

program SkipList;

type
  Node = record
    value: Integer;
    next: array of Node;
  end;

  SkipList = record
    head: Node;
    maxLevel: Integer;
  end;

procedure initSkipList(var list: SkipList; maxLevel: Integer);
begin
  list.maxLevel := maxLevel;
  SetLength(list.head.next, maxLevel);
end;

function randomLevel(maxLevel: Integer): Integer;
var
  level: Integer;
begin
  level := 1;
  while (Random(2) = 0) and (level < maxLevel) do
    Inc(level);
  randomLevel := level;
end;

procedure insertElement(var list: SkipList; value: Integer);
var
  update: array of Node;
  current, newNode: Node;
  i, level: Integer;
begin
  current := list.head;
  SetLength(update, list.maxLevel);

  for i := list.maxLevel - 1 downto 0 do
  begin
    while (current.next[i].value < value) do
      current := current.next[i];
    update[i] := current;
  end;

  level := randomLevel(list.maxLevel);
  newNode.value := value;
  SetLength(newNode.next, level);

  for i := 0 to level - 1 do
  begin
    newNode.next[i] := update[i].next[i];
    update[i].next[i] := newNode;
  end;
end;

procedure deleteElement(var list: SkipList; value: Integer);
var
  update: array of Node;
  current: Node;
  i: Integer;
begin
  current := list.head;
  SetLength(update, list.maxLevel);

  for i := list.maxLevel - 1 downto 0 do
  begin
    while (current.next[i].value < value) do
      current := current.next[i];
    update[i] := current;
  end;

  current := current.next[0];

  if (current.value = value) then
  begin
    for i := 0 to list.maxLevel - 1 do
    begin
      if (update[i].next[i].value = value) then
        update[i].next[i] := current.next[i];
    end;
  end;
end;

function searchElement(list: SkipList; value: Integer): Boolean;
var
  current: Node;
  i: Integer;
begin
  current := list.head;

  for i := list.maxLevel - 1 downto 0 do
  begin
    while (current.next[i].value < value) do
      current := current.next[i];
  end;

  current := current.next[0];

  searchElement := (current.value = value);
end;

procedure printSkipList(list: SkipList);
var
  current: Node;
begin
  current := list.head.next[0];

  while (current <> nil) do
  begin
    Write(current.value, ' ');
    current := current.next[0];
  end;
  Writeln;
end;

var
  list: SkipList;
begin
  initSkipList(list, 5);
  insertElement(list, 3);
  insertElement(list, 6);
  insertElement(list, 2);
  insertElement(list, 5);
  printSkipList(list);

  if searchElement(list, 6) then
    Writeln('Element 6 found')
  else
    Writeln('Element 6 not found');

  deleteElement(list, 2);
  printSkipList(list);
end.

Это пример реализации структуры данных Skip List на языке Pascal. В этой программе есть процедуры для инициализации Skip List, добавления элемента, удаления элемента, поиска элемента и вывода всей структуры.