Task: Find Kth Smallest Element in a Binary Search Tree

Task: Find Kth Smallest Element in a Binary Search Tree: a task in Terminal-Lego-15k (Harbor dataset). Implement an efficient algorithm to find the kth smallest element in a Binary Search Tree (BST). Your solution should leverage the properties of BSTs to achieve optimal performance.