leetcode230:Kth Smallest Element in a BST
Description: 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.Follow up: What if t
原创
2017-12-05 00:24:09 ·
186 阅读 ·
0 评论