LC-0230 Medium LeetCode

230. Kth Smallest Element in a BST

Tree Depth-First Search Binary Search Tree Binary Tree

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 75% Topics: Tree, Depth-First Search, Binary Search Tree, Binary Tree

Reading material

Reference solution (spoiler · python)

# Time:  O(max(h, k))
# Space: O(h)

class Solution(object):
    # @param {TreeNode} root
    # @param {integer} k
    # @return {integer}
    def kthSmallest(self, root, k):
        s, cur, rank = [], root, 0

        while s or cur:
            if cur:
                s.append(cur)
                cur = cur.left
            else:
                cur = s.pop()
                rank += 1
                if rank == k:
                    return cur.val
                cur = cur.right

        return float("-inf")


# time: O(max(h, k))
# space: O(h)

from itertools import islice


class Solution2(object):
    def kthSmallest(self, root, k):
        """
        :type root: TreeNode
        :type k: int
        :rtype: int
        """
        def gen_inorder(root):
            if root:
                for n in gen_inorder(root.left):
                    yield n

                yield root.val

                for n in gen_inorder(root.right):
                    yield n

        return next(islice(gen_inorder(root), k-1, k))

Solution from kamyu104/LeetCode-Solutions · MIT