给定一棵二叉搜索树,请找出其中的第k小的结点。例如, (5,3,7,2,4,6,8) 中,按结点数值大小顺序第三小结点的值为4。
前序遍历并将值传入集合,集合排序,新建一个辅助结点将第K个小的值存入,返回该结点。
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.ArrayList;
import java.util.Collections;
public class Solution {
TreeNode KthNode(TreeNode pRoot, int k)
{
if(pRoot == null || k == 0)return null;
ArrayList<Integer> list = new ArrayList<>();
getTree(pRoot,list);
if(list.size()<k)return null;
Collections.sort(list);
TreeNode node = new TreeNode(list.get(k-1));
return node;
}
public void getTree(TreeNode pRoot,ArrayList list){
if(pRoot == null){
return;
}else{
list.add(pRoot.val);
}
getTree(pRoot.left,list);
getTree(pRoot.right,list);
}
}