LeetCode MEDIUM 230 Kth Smallest Element in a BST Summary
Generated by Codex with GPT 5.6 Sol XHigh
Quick facts
- Difficulty:
MEDIUM - Problem: Kth Smallest Element in a BST
- Topics:
Tree,Depth-First Search,Binary Search Tree,Binary Tree
The problem in plain language
Given the root of a binary search tree and a 1-indexed number k, return the value that would appear in position k if all node values were arranged from smallest to largest.