Kth Smallest Element in a BST

Question

## Problem

Return the kth smallest value in a binary search tree.

## Example
```
in-order traversal -> kth visited
```

## Constraints
- 1 ≤ k ≤ nodes

## Approach
In-order traversal (iterative) stopping at k. Reported Asana question.