# 【leetcode】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.

### 三、Java AC代码

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

#### 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

2015-07-02 14:27:17

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

2016-02-16 15:27:50

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

2017-04-29 10:36:27

#### [leetcode] 378. Kth Smallest Element in a Sorted Matrix

2016-08-02 16:38:33

#### [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 230]Kth Smallest Element in a BST----求二叉搜索树的第K小值

2016-03-09 21:51:39

#### 【Leetcode】Kth Smallest Element in a Sorted Matrix

2016-08-01 21:54:16