Kth Smallest Element in a BST

Given a BST in level-order form and an integer k, print the k-th smallest value (1-indexed).

1 <= k <= number of nodes <= 10^4