leetcode230

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int KthSmallest(TreeNode root, int k)
        {
            int count = countNodes(root.left);
            if (k <= count)
            {
                return KthSmallest(root.left, k);
            }
            else if (k > count + )
            {
                return KthSmallest(root.right, k -  - count); // 1 is counted as current node
            }

            return root.val;
        }

        public int countNodes(TreeNode n)
        {
            if (n == null) return ;

            return  + countNodes(n.left) + countNodes(n.right);
        }
}

https://leetcode.com/problems/kth-smallest-element-in-a-bst/#/description

补充一个python的实现，使用二叉树的中序遍历：

 class Solution:
     def __init__(self):
         self.l = list()

     def inOrder(self,root):
         if root != None:
             self.inOrder(root.left)
             self.l.append(root.val)
             self.inOrder(root.right)

     def kthSmallest(self, root: TreeNode, k: int) -> int:
         self.inOrder(root)
         return self.l[k-]