# Middle-题目16：230. Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

public class Solution {
public int kthSmallest(TreeNode root, int k) {
List<Integer> list=new ArrayList<Integer>();
traverse(root,list);
return list.get(k-1);
}
public void traverse(TreeNode node,List<Integer> list) {
if(node!=null) {
traverse(node.left,list);
traverse(node.right,list);
}
return;
}
}

2ms，beats 16.50%，众数1ms，49.50%

#### LeetCode 230: Kth Smallest Element in a BST

2015-07-02 14:27:17

#### leetcode 230. Kth Smallest Element in a BST-递归|非递归

2016-05-24 11:17:50

#### leetcode 230: Kth Smallest Element in a BST

2015-07-07 06:14:58

#### LeetCode 230. Kth Smallest Element in a BST 解题报告

2016-02-16 15:27:50

#### LeetCode230——Kth Smallest Element in a BST

2015-08-03 14:25:26

#### LeetCode-230. Kth Smallest Element in a BST (JAVA)二叉树第k小的数字

2017-04-29 10:36:27

#### leetcode_230. Kth Smallest Element in a BST 求二叉搜索树中的第k小的元素，中序遍历法

2016-11-28 17:48:27

#### [leetcode] 378. Kth Smallest Element in a Sorted Matrix 解题报告

2016-08-20 15:43:59

#### LeetCode—378. Kth Smallest Element in a Sorted Matrix

2016-08-02 10:20:37

#### 【leetcode】378. Kth Smallest Element in a Sorted Matrix

2016-08-06 13:21:58