LC 0230 [M] Kth Smallest Element in a BST - ALawliet/algorithms GitHub Wiki
# 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
class Solution:
def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:
res = []
def inorder(node):
if not node: return
inorder(node.left)
res.append(node.val)
# if len(res) == k: return
inorder(node.right)
inorder(root)
return res[k-1]