/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
private int index;
public int kthSmallest(TreeNode root, int k) {
if(root == null) return 0;
int leftval = kthSmallest(root.left, k);
if(k == index){
return leftval;
}else if(k == ++index){
return root.val;
}
return kthSmallest(root.right, k);
}
}
思路:中序遍历