[问题描述]求一棵树的深度与宽度。 [算法说明]树可用数组t

program exgp3;
 const n = 13;
 var
   i, j, k, sp1, sp2, n1, n2, jmax, p : integer;
   tree : array[1..n, 1..5]of integer;
   g : array[1..n, 1..7]of integer;
 begin
   for i:=1 to n do
   begin
     tree[i, 1] := i;
     for j:=2 to 5 do read (tree[i, j]);
     readln;
   end;
   sp1 := 1;
   sp2 := 1;
   g[1, 1] := 0;
   g[1, 2] := 1;
   g[1, 3] := 1;
   for i:=4 to 7 do g[1, i] := tree[1, i - 2];
   while__________1_________do
     begin
       p:=g[sp1, 2];
       n2 := g[sp1, 3];
       _________2________;
       j := 4;
       while _________3_________do
         begin
           n1:=g[sp1, j];
           j := j + 1;
           __________4_________;
           g[sp2, 1] := n2;
           g[sp2, 2] := p;
           g[sp2, 3] := n1;
           for i:=1 to 4 do g[sp2, i + 3] := tree[n1, i + 1];
         end;
       __________5_________;
     end;
     writeln('maxd=',g[sp2, 2]); j:=1; k:=g[1, 2]; jmax:=0;
     for i:=2 to sp2 do
       if __________6__________then j:=j+1
       else
         begin
           if j>jmax then jmax:=j;
           __________7________; k:=g[i, 2];
         end;
   if j>jmax then jmax:=j;
   writeln('max1=',jmax);
 end.