题目描述
给定一个二叉搜索树的根节点 root ,和一个整数 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 {
List<Integer> list = new LinkedList<>();
public int kthSmallest(TreeNode root, int k) {
dfs(root);
return list.get(k - 1);
}
public void dfs(TreeNode node) {
if(node == null) {
return;
}
dfs(node.left);
list.add(node.val);
dfs(node.right);
}
}