program DicTest;

  USES  LZTests,
	LZTypes,
	LZBase;

var
  PDic:tPDictionary;
  DicSize:word;
  i,n:tIndex;

begin
  writeln;
  writeln('Program TestBinaryTree start...');
  DicSize:=SizeOf(PDic^.Indexes)+301*SizeOf(tNode);
  GetMem(PDic,DicSize);
  PDic^.Indexes.Max:=100;
  PDic^.Indexes.FirstFree:=cRootIndex+1;
  for i:=Low(i) to PDic^.Indexes.FirstFree do begin
    ClearNode(PDic^.Nodes[i]);
  end;
  Include(PDic^.Nodes[cRootIndex].Flags,nfRoot);
  Randomize;
  for i:=Low(i) to 400 do begin
    n:=AddNodeToBinaryTree(PDic^,cRootIndex,random(255));
  end;
  if SeqCheck(PDic^,cRootIndex)<>cNilIndex then
    PrintLine(PDic^,cRootIndex);
  FreeMem(PDic,DicSize);
  writeln('Program TestBinaryTree end.');
end.