дерево

[jekie182]

будто правельно работает но в конце вывода 268 (
и кучу непонятных чисел (
нужно найти наименьший элемент дерева!
вот код
Program BinDerevo;
uses crt;
type
TreeType = ^ElType;
ElType = Record
inf: integer;
Left, Right: TreeType;
end;
Var tree: TreeType;z: integer;
{------------------------------------------------------------------}
Procedure AddElement(var b: TreeType; k:integer);
begin
if b=nil then
begin
new(b);
b^.inf:=k;
b^.left:=nil;
b^.right:=nil;
end
else
if b^.inf<=k then AddElement(b^.left, k)
else AddElement(b^.right, k);
end;

{-----------------------------------------------------------------------------------------}
Procedure PrintTree(b: TreeType; t: integer);
begin
if b=nil then writeln('derevo puste')
else with b^ do
begin
inc(t);
if left<>nil
then PrintTree(left,t);
write(' ':4*t);
writeln(inf:4);
if right<>nil
then PrintTree(right,t);
dec(t);
end;
end;
{-----------------------------------------------------------------------------------------------------------------}
Procedure SortDown(var b:TreeType);
begin
if b=nil then writeln('derevo puste')
else with b^ do
begin
if right<>nil then SortDown(right);
write(inf,' ');
if left<>nil then SortDown(left);
end;
writeln(b^.left^.inf);
readln;
end;
{------------------------------------------------------------------------}
Procedure ClearTree(var b:TreeType);
begin
if b<>nil then
begin
if b^.left<>nil then ClearTree(b^.left);
if b^.right<>nil then ClearTree(b^.right);
dispose(b);
end;
end;
{------------------------------------------------------------------------------------------------------------------}
begin
tree:=nil;
clrscr;
checkeof:=true;
writeln('vvedit chusla poslidovnosti v kinci- 111');
while z <>111 do
begin
read(z);
AddElement(tree,z);
readln;
end;
writeln('gotove derevo ');
PrintTree(tree,0);readln;
writeln('naimenshi ');
readln;
SortDown(tree);
readln;
ClearTree(tree);
end.

[BDA]

program BinDerevo;

uses
  crt;

type
  TreeType = ^ElType;
  ElType = Record
    inf: integer;
    Left, Right: TreeType;
  end;

var
  tree: TreeType;z: integer;
{------------------------------------------------------------------}
procedure AddElement(var b: TreeType; k: integer);
begin
  if b = nil then
  begin
    new(b);
    b^.inf := k;
    b^.left := nil;
    b^.right := nil;
  end
  else
  if b^.inf <= k then AddElement(b^.left, k)
  else AddElement(b^.right, k);
end;

{-----------------------------------------------------------------------------------------}
procedure PrintTree(b: TreeType; t: integer);
begin
  if b = nil then writeln('derevo puste')
  else with b^ do
    begin
      inc(t);
      if left <> nil
        then PrintTree(left, t);
      write(' ':4 * t);
      writeln(inf:4);
      if right <> nil
        then PrintTree(right, t);
      dec(t);
    end;
end;
{-----------------------------------------------------------------------------------------------------------------}
procedure findmin(var b: TreeType);
var
  tmp: treetype;
begin
  tmp := b;
  if tmp = nil then writeln('derevo puste')
  else
  begin
    while tmp^.Right <> nil do
      tmp := tmp^.right;
    writeln(tmp^.inf);
  end;
end;
{------------------------------------------------------------------------}
procedure ClearTree(var b: TreeType);
begin
  if b <> nil then
  begin
    ClearTree(b^.left);
    ClearTree(b^.right);
    dispose(b);
  end;
end;
{------------------------------------------------------------------------------------------------------------------}
begin
  tree := nil;
  clrscr;
  writeln('vvedit chusla poslidovnosti v kinci- 111');
  readln(z);
  while z <> 111 do
  begin
    AddElement(tree, z);
    readln(z);;
  end;
  writeln('gotove derevo ');
  PrintTree(tree, 0);readln;
  writeln('naimenshi ');
  readln;
  findmin(tree);
  readln;
  ClearTree(tree);
end.