230 Kth Smallest Element in a BST.py

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

class Solution(object):
    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        inoerder_list = []
        def inoiterate(root):
            if not root:
                return None
            inoiterate(root.left)
            inoerder_list.append(root.val)
            inoiterate(root.right)
        
        inoiterate(root)

        return inoerder_list[k-1]