548 2/1/2017 7:57:27 AM


A binary search tree T and a target key t.


A vertex v of T such that key(v) = t if t is found, or NULL if t is not found.


v := root(T)

While (v is not NULL) and (t is not key(v))

If t > key(v)

then v := rightchild(v)

else v := leftchild(v)

Return v.