Kth smallest element in BST

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right

# def inorder(root,ans):
#     if root:
#         inorder(root.left,ans)
#         ans.append(root.val)
#         inorder(root.right,ans)

# class Solution:
#     def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
#         ans=[]
#         inorder(root,ans)
#         print(ans)
#         return ans[k-1]

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right

def inorder(node, data):
    if not node or data["k"] == 0:
        return

    inorder(node.left, data)

    data["k"] -= 1
    if data["k"] == 0:
        data["ans"] = node.val
        return

    inorder(node.right, data)

class Solution:
    def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
        data = {"k": k, "ans": -1}
        inorder(root, data)
        return data["ans"]