A. Procedure tim kiem tuan tu(k,n,x);

i:=1;

While (i<=n) And (k[i]<> x) Do

i:=i+1;

If i>n Then i:=o;

Return(i);

B.Tim kiem co bo sung:

Funtion timnut(t,x);

If t=nil Then

Begin

New(t); key(t):=x;

LPTR(t) := RPTR := nil;

timnut := t;

End;

Else if key(t)= Then timnut:=t

Else If key(t) > x then

timnut:=timnut(LPTR(t),x)

Else timnut := timnut(RPTR(t),x)

Return;