˙Ş(type tree = ^p;p =recordn:T; left:tree; right:tree;end;(procedure root (var a:tree; var inf:TF);begin new(a); read(a^.n,inf); a^.left:=nil; a^.right:=nil;end;#procedure addleaf(var a:tree, n:T);beginif a<>nil thenbegin$ if n>=a^.n then addleaf(a^.right,n) else addleaf(a^.left,n)endelsebegin new(a); a^.left:=nil; a^.right:=nil; a^.n:=n;end;end;+procedure maketree(var p:tree; var inf:TF);var n:T;beginwhile not(eof(inf)) dobegin read(inf,n); addleaf(p,n);end;end;*„*+„+-+Nq0FZKƒ + ˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙˙8-Ď)i-(˙˙^Kƒ^Kƒ!- ˙´)\Kƒ8xxKj0ƒ   xxKl0ƒ  ˙