$\backslash ([25\backslash$mathrm$\{$pt$\}]\backslash )$ Question $4($ordered$-$statistics$)$

Use the textbook pseudo$-$code to describe an algorithm that returns the $\backslash ($ k$^\{\backslash$text $\{$th $\}\}\backslash )$ smallest element in a given binary search tree $($BST$).$ A BST is a binary tree where the value of each node is greater than all the values in the respective node's left sub$-$tree and less than the ones in its right sub$-$tree. Your algorithm's run$-$time should be $\backslash ($ O$($k$)\backslash ).$