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整型
*/
int count;
int n;
public int KthNode (TreeNode proot, int k) {
// write code here
if(proot == null){
return -1;
}
this.count = -1;
this.n = k;
dfs(proot);
return count;
}
void dfs(TreeNode root){
if(root.left != null){
dfs(root.left);
}
n--;
if(n == 0){
count = root.val;
return;
}
if(root.right != null){
dfs(root.right);
}
}
}
/*
* 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整型
*/
int count;
int n;
public int KthNode (TreeNode proot, int k) {
// write code here
if(proot == null){
return -1;
}
this.count = -1;
this.n = k;
dfs(proot);
return count;
}
void dfs(TreeNode root){
if(root.left != null){
dfs(root.left);
}
n--;
if(n == 0){
count = root.val;
return;
}
if(root.right != null){
dfs(root.right);
}
}
}