class Solution {
public:
int count = 0;
TreeNode* KthNode(TreeNode* pRoot, int k)
{
if(pRoot == nullptr || k == 0) return nullptr;
TreeNode* node = KthNode(pRoot->left, k);
if(node != nullptr) return node;
count++;
if(count == k) return pRoot;
node = KthNode(pRoot->right, k);
if(node != nullptr) return node;
return nullptr;
}
};
剑指offer54二叉搜索树的第K大节点
最新推荐文章于 2022-04-01 19:39:32 发布