题目描述
思路分析
二叉树+dfs
代码实现
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
TreeNode* res;
TreeNode* KthNode(TreeNode* root, int k) {
dfs(root,k);
return res;
}
void dfs(TreeNode* root,int& k){
if(!root) return;
dfs(root->left,k);
k--;
if(!k) res=root;
if(k>0) dfs(root->right,k);
}
};