题目
题目链接:
https://www.nowcoder.com/practice/57aa0bab91884a10b5136ca2c087f8ff
思路
中序遍历
参考答案
import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* public TreeNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param proot TreeNode类
* @param k int整型
* @return int整型
*/
public int KthNode (TreeNode proot, int k) {
if (proot == null) return -1;
//利用非递归中序遍历思路来做
Stack<TreeNode> stk = new Stack<>();
int cnt = 0;
while (!stk.isEmpty() || proot != null) {
while (proot != null) {
stk.add(proot);
proot = proot.left;
}
proot = stk.pop();
cnt++;
if (cnt == k) return proot.val;
proot = proot.right;
}
return -1;
}
}