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;