Kth Smallest Element in a BST (Leetcode 230)
230. Kth Smallest Element in a BST
Medium
netflix, amazon, microsoft, linkedin, apple, google, facebook
May Leetcode Challenge (during covid-19)! Day 20
GITHUB code (C#): https://github.com/pravhub/Coding-Int...
GITHUB code (Java):https://github.com/pravhub/Coding-Int...
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.
Example 1:
Input: root = [3,1,4,null,2], k = 1
3
/ \
1 4
\
2
Output: 1
Example 2:
Input: root = [5,3,6,2,4,null,null,1], k = 3
5
/ \
3 6
/ \
2 4
/
1
Output: 3