Function kthSmallest

kth_smallest_element_in_a_bst_230/solution.go:8–11

(root *TreeNode, k int)

)

func kthSmallest(root *TreeNode, k int) int {
	_, v := inOrderTraverse(root, k)
	return v
}

func inOrderTraverse(root *TreeNode, k int) (int, int) {
	if root == nil {