procedure search( key : typekey; t : tree );
begin
if t=nil then {*** Not Found ***}
notfound( key )
else if t^.k = key then {*** Found ***}
found( t^ )
else if t^.k < key then search( key, t^.right )
else search( key, t^.left )
end;
C source (3411.srch.c) Pascal source (3411.srch.p)
![[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 (3411.srch.c) 