Multiple choice

What is the running time of the algorithm?

An iterative algorithm to search for key k in a tree T is given below. Assume that the tree has n nodes and height h.
search(T,k)
{
x = root(t);
while(x!=null or x!= k)
{
if(x < k) x= right[x];
else x = left[x];
}
return x;
}

Reveal answer Fill a bubble to check yourself

What is the running time of the algorithm? An iterative algorithm to search for key k in a tree T is given below. Assume that the tree has n nodes and height h.search(T,k){ x = root(t); while(x!=null or x!= k){ if(x < k) x= right[x]; else x = left[x]; } return x; }