剑指offer62 二叉搜索树的第k个结点

题目

给定一棵二叉搜索树，请找出其中的第k小的TreeNode结点。

思想

中序遍历

代码

import java.util.ArrayList;
/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    //用中序遍历的方法
    TreeNode KthNode(TreeNode pRoot, int k) {
        TreeNode result = new TreeNode(0);
        if(pRoot == null || k <= 0)
            return null;
        ArrayList<TreeNode> list = new ArrayList<TreeNode>();
        Middle(pRoot,list);
        if(k > list.size())
            return null;
        return list.get(k-1);
    }
    
    void Middle(TreeNode root,ArrayList<TreeNode> list)
    {
        if(root == null)
            return;
        Middle(root.left,list);
        list.add(root);
        Middle(root.right,list);
    }


}