1 /*
 2 struct TreeNode {
 3     int val;
 4     struct TreeNode *left;
 5     struct TreeNode *right;
 6     TreeNode(int x) :
 7             val(x), left(NULL), right(NULL) {
 8     }
 
 9 };
10 */
11 class Solution {
12 public:
13     //實現中序遍歷,對於二叉搜索樹中序遍歷是按節點從小到大排序
14     TreeNode *KthNodeCore(TreeNode *root, int &k)//註意此處k為引用，因為在操作過程中k改變
15     {
16         TreeNode *target = NULL;
17         if(root->left != NULL)
18         {
19             target = KthNodeCore(root->left,k);
 
20         }
21         if(target == NULL)//無左節點且還未找到，返回其葉子節點的父節點，k--
22         {
23             if(k == 1)
24                 target = root;
25             k--;
26         }
27         if(target == NULL && root->right != NULL)//找右結點
28         {
29             target = KthNodeCore(root->right,k);
 
30         }
31         return target;
32     }
33     TreeNode* KthNode(TreeNode* pRoot, int k)
34     {
35         if(pRoot == NULL || k == 0)
36             return NULL;
37         return KthNodeCore(pRoot,k);
38     }
39 };

62、劍指offer--二叉搜索樹的第k個結點