二叉搜索树的第k个结点

题目连接:https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

 

import java.util.*;
public class Solution {
    List<TreeNode> list = new ArrayList<>();
    TreeNode KthNode(TreeNode pRoot, int k)
    {
        if(pRoot == null || k <= 0){
            return null;
        }
        mid(pRoot);
        if(list.size() < k){
            return null;
        }
        return list.get(k -1);
    }
    
    public void mid(TreeNode root){
        if(root != null){
            if(root.left !=null){
                mid(root.left);
            }
            list.add(root);

            if(root.right != null){
                mid(root.right);
            }
        }
    }

}