"""
Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

Note: 
You may assume k is always valid, 1 ≤ k ≤ BST's total elements.
"""
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
"""
Recursive
Time: O(N)
Space: O(N)
"""
class Solution:
    def kthSmallest(self, root: TreeNode, k: int) -> int:
        def inorder(root):
            return inorder(root.left) + [root.val] + inorder(root.right) if root else []
        
        return inorder(root)[k-1]
    
"""
Iterative
Time: O(H+K) where H is a tree height
Space: O(H+K)
"""
class Solution:
    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        stack = []
        
        while True:
            while root:
                stack.append(root)
                root = root.left
            root = stack.pop()
            k -= 1
            if not k:
                return root.val
            root = root.right



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

class Solution:
    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        order = []

        def inOrder(root):
            if not root:
                return
            inOrder(root.left)
            order.append(root.val)
            inOrder(root.right)

        inOrder(root)
        return order[k - 1]

f2b9bfeb3a0360305b7f1cd52feaf9c3e64a27ee
<mask token>


class Solution:

    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        order = []

        def inOrder(root):
            if not root:
                return
            inOrder(root.left)
            order.append(root.val)
            inOrder(root.right)
        inOrder(root)
        return order[k - 1]

<mask token>


class Solution:

    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        stack = []
        while True:
            while root:
                stack.append(root)
                root = root.left
            root = stack.pop()
            k -= 1
            if not k:
                return root.val
            root = root.right


class Solution:

    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        order = []

        def inOrder(root):
            if not root:
                return
            inOrder(root.left)
            order.append(root.val)
            inOrder(root.right)
        inOrder(root)
        return order[k - 1]

<mask token>


class Solution:
    <mask token>


<mask token>


class Solution:

    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        stack = []
        while True:
            while root:
                stack.append(root)
                root = root.left
            root = stack.pop()
            k -= 1
            if not k:
                return root.val
            root = root.right


class Solution:

    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        order = []

        def inOrder(root):
            if not root:
                return
            inOrder(root.left)
            order.append(root.val)
            inOrder(root.right)
        inOrder(root)
        return order[k - 1]

<mask token>


class Solution:

    def kthSmallest(self, root: TreeNode, k: int) ->int:

        def inorder(root):
            return inorder(root.left) + [root.val] + inorder(root.right
                ) if root else []
        return inorder(root)[k - 1]


<mask token>


class Solution:

    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        stack = []
        while True:
            while root:
                stack.append(root)
                root = root.left
            root = stack.pop()
            k -= 1
            if not k:
                return root.val
            root = root.right


class Solution:

    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        order = []

        def inOrder(root):
            if not root:
                return
            inOrder(root.left)
            order.append(root.val)
            inOrder(root.right)
        inOrder(root)
        return order[k - 1]

"""
Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

Note: 
You may assume k is always valid, 1 ≤ k ≤ BST's total elements.
"""
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
"""
Recursive
Time: O(N)
Space: O(N)
"""
class Solution:
    def kthSmallest(self, root: TreeNode, k: int) -> int:
        def inorder(root):
            return inorder(root.left) + [root.val] + inorder(root.right) if root else []
        
        return inorder(root)[k-1]
    
"""
Iterative
Time: O(H+K) where H is a tree height
Space: O(H+K)
"""
class Solution:
    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        stack = []
        
        while True:
            while root:
                stack.append(root)
                root = root.left
            root = stack.pop()
            k -= 1
            if not k:
                return root.val
            root = root.right



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

class Solution:
    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        order = []

        def inOrder(root):
            if not root:
                return
            inOrder(root.left)
            order.append(root.val)
            inOrder(root.right)

        inOrder(root)
        return order[k - 1]
