Searching a Binary Search Tree

Given a root ode x and a key k$,$ the TREE$\_$SEARCH$($x$,$k$)$ procedure recursively searches the tree for the key K$,$ returning NIL if k is not found. Identify the missing piece of code.

TREE$\_$SEARCH$($x$,$ k$)$

if

return x

if k