Given the root node of a binary search tree and an integer value k, return the $k^{th}$ smallest value in the tree.

Constraints:

• The number of nodes in the tree is $n$.
• $1 \leq k \leq n \leq 500$
• $0 \leq$ Node.data $\leq 10^4$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Note: As an additional challenge, we have intentionally hidden the solution to this puzzle.

Implement your solution in main.py in the following coding playground.