[leetcode] 230.Kth Smallest Element in a BST

原创 2015年07月08日 14:43:26

题目:
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

Note:
You may assume k is always valid, 1 ≤ k ≤ BST’s total elements.

Follow up:
What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently? How would you optimize the kthSmallest routine?
题意:
给一个二叉搜索树,寻找第k大元素。
思路:
结合二叉搜索树的特点,对二叉搜索树进行中序遍历的结果就是按照元素的升序排列。
所以采用中序遍历,并且保存遍历到当前位置的下标,如果到了k的位置,那么赋值,并且返回。
以上。
代码如下:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int kthSmallest(TreeNode* root, int k) {
     if(root == NULL)return 0;
     int value = 0;
     int index = 0;
     InOrder(root, k, value, index);
     return value;
    }
    void InOrder(TreeNode* root, int k, int& value, int& before) {
        if(root == NULL)return;
        InOrder(root->left, k, value, before);
        before++;
        if(before == k){
            value = root->val;
            before = k;
            return;
        }
        else if(before > k)return;
        InOrder(root->right, k, value, before);
    }
};

【LEETCODE】230-Kth Smallest Element in a BST

Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. No...

LeetCode - 230. Kth Smallest Element in a BST

这道题目需要利用BST的性质,就是如果对BST进行中序遍历的话,得到的序列的一定是sorted,所以一开始使用了一个ArrayList存储访问的元素,然后返回第k - 1个。但是这种方法不太好,更好的...

Leetcode 230. Kth Smallest Element in a BST (Medium) (cpp)

Leetcode 230. Kth Smallest Element in a BST (Medium) (cpp)
  • Niko_Ke
  • Niko_Ke
  • 2016年08月23日 11:17
  • 289

LeetCode 230. Kth Smallest Element in a BST 解题报告

LeetCode 230. Kth Smallest Element in a BST 解题报告

leetcode-230-Kth Smallest Element in a BST

Kth Smallest Element in a BST   Given a binary search tree, write a function kthSmallest to ...

leetcode 230. Kth Smallest Element in a BST-递归|非递归

原题链接:230. Kth Smallest Element in a BST 【思路-Java、Python】——递归实现 我们知道二分查找数(BST)的性质——任何一个节点的值均大于左子树的任意节...

<LeetCode OJ> 230. Kth Smallest Element in a BST

230. Kth Smallest Element in a BST My Submissions Question Total Accepted: 32753 Total Submissio...

【leetcode】230. Kth Smallest Element in a BST

一、题目描述 Given a binary search tree, write a function kthSmallest to find the kth smallest elem...

[LeetCode]230.Kth Smallest Element in a BST

题目Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.No...

leetcode -- 230. Kth Smallest Element in a BST 【遍历 + 计数】

题目 Given a binary search tree, write a function kthSmallest to find the kth smallest element in it....
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[leetcode] 230.Kth Smallest Element in a BST
举报原因:
原因补充:

(最多只允许输入30个字)