Ausbalancierte Bäume Sortieren mit AVL-Bäumen

epeat
BegTree:=UpperT;
UpperT:=UpperT^.Last;
until (UpperT=nil) or (UpperT^.Right=BegTree);
if UpperTnil then
Move(UpperT^.Data^, LData, DatSize)
else
FillChar(LData,DatSize,0);
LastNode:=UpperT;
end;
end;
{* ════════════════════════════════════════════*}
function SearchNode(Var SKey, SData;
BegTree: AvlTree): AvlTree;
begin
if BegTree=nil then
begin
SearchNode:=nil; Exit;
end;
repeat
case Compare(SKey,BegTree^.TreeKey) of
Equal : begin
Move(BegTree^.Data^, SData, DatSize);
SearchNode:=BegTree;
Exit;
end;
Small : BegTree:=BegTree^.Left;
Bigger : BegTree:=BegTree^.Right;
end;
until BegTree=nil;
FillChar(SData,DatSize,0);
SearchNode:=NIL;
end;
{* ════════════════════════════════════════════*}
procedure ReplaceData(Var OldKey, NewData;
RepTree: AvlTree;
Var Success: boolean);
var RepNode : AvlTree;
Dummy : DatArray;
begin
RepNode:=SearchNode(OldKey, Dummy, RepTree);
if RepNode=NIL then
begin
Success:=false;
Exit;
end;
Success:=true;
Move(NewData, RepNode^.Data^, DatSize);
end;
{**********************************************}
{* Prozeduren zur Erhaltung der AVL-Struktur *}
{**********************************************}
procedure AllBalanceFactors(AVL: AvlTree;
Var Height: Integer);
var B, HLeft, HRight : Integer;
begin
if AVL=nil then
begin