Let T be a binary search tree whose data can be compared using $<.$ Consider the following algorithm.

Precondition: Some node in T contains value t$.$

l $0$

x $$ the root of T

while

x $!=$ t

if

x $<$ t

then

x $$ x$\text{'}$s right child

else

x $$ x$\text{'}$s left child

l $$ l $+1$