230. Kth Smallest Element in a BST

題目描述 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. 方法思路 求一組數中的第K個最小值是類非常經典的題目，看

>>阅读原文<<