|
<![CDATA[
procedure InsInNode( t : btree; key : typekey; ptr : btree );
label 999;
var j : integer;
begin
with t^ do begin
j := d;
while j >= 1 do
if key < k[j] then begin
k[j+1] := k[j];
p[j+1] := p[j];
j := j-1
end
else goto 999; {*** break ***}
999:
k[j+1] := key;
p[j+1] := ptr;
d := d+1
end
end;
]]> |
![[Home]](../../images/home_g.gif)
![[Chapter]](../../images/chapter_g.gif)
![[Contents]](../../images/contents_g.gif)
![[Previous Algorithm]](../../images/prevalg_g.gif)
![[Next Algorithm]](../../images/nextalg_g.gif)
C source (342.iin.c) 