二叉搜素树的第k个结点

题目描述

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

示例1

输入

{5,3,7,2,4,6,8},3

返回值

{4}

说明

按结点数值大小顺序第三小结点的值为4  

方法一：借助 ArrayList， 先序遍历搜索树，得到递增的数列

 

/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

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

    }

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

}

 

方法二：递归，先序遍历搜索树

/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

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

    }

}
*/
public class Solution {
    int count=0;
    TreeNode KthNode(TreeNode pRoot, int k) {
        if(pRoot==null || k==0) return null;
        TreeNode node = KthNode(pRoot.left, k);
        if(node != null) return node;
        count++;
        if(k==count) return pRoot;
        node = KthNode(pRoot.right, k);
        if(node != null) return node;
        return null;
    }

}