力扣230.二叉搜索树中第K小的元素

230.二叉搜索树中第K小的元素

思路：

1. 因为是二叉搜索树，所以可以中序遍历放进链表中，中序遍历就是从小到大的顺序
2. 根据第k小的元素直接获取链表的 第k-1就行了

代码实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int kthSmallest(TreeNode root, int k) {
		List<Integer> list = new LinkedList<Integer>();
		inorder(root, list);
		
		return list.get(k - 1);
    }
	
	public void inorder(TreeNode root, List<Integer> list) {
		if (root == null) return;
		
		inorder(root.left, list);
		list.add(root.val);
		inorder(root.right, list);
	}
}