Hi, Need to create pseudo-code or implement in c++, java, or python for following question:

Hi,

Need to create pseudo-code or implement in c++, java, or python for following question:

" For a key k that is not found in a binary search tree T, prove that both the greatest key less than k and the least key greater than k lie on the path traced by the search for k."

Thank you for your help!