LeetCode230.二叉搜索树中第K小的元素

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int kthSmallest(TreeNode root, int k) {
        //二叉搜索树的中序遍历是升序排序
        traverse(root,k);
        return res;
    }


    //记录结果
    int res=0;
    //记录当前元素的排名
    int rank=0;

    public void traverse(TreeNode root,int k){
        if(root==null){
            return;
        }
        traverse(root.left,k);
        rank++;
        if(k==rank){
            res=root.val;
            return;
        }
        traverse(root.right,k);
    }
}