Closed
Description
Is there an existing issue for this?
- I have searched the existing issues
Feature Description
[Kth Smallest Element in a BST]
Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree.
Use Case
For users to be able to see the solutions and understand it.
Benefits
No response
Add ScreenShots
No response
Priority
High
Record
- I have read the Contributing Guidelines
- I'm a GSSOC'24 contributor
- I have starred the repository