Home
Topics
Practice
Roadmap
DSA Tracker
Code Editor
Tech Blogs
More
Sign in
Get started
Loading question...
Feedback
Kth Smallest Element in a BST
Medium
00:00
0 users online
Share
Description
Solution
Submissions
Discussion
Given a BST, find the kth smallest element.
Sample Input:
[3,1,4,null,2], 1
Sample Output:
1
Hints
Hint 1
Use inorder traversal (left, root, right)
Hint 2
Count nodes as you traverse
Hint 3
Stop when count reaches k
Code Editor
Reset
Run
Save
Loading...