leetcode-230-Kth Smallest Element in a BST

原创 2015年07月09日 12:10:36

                                    Kth Smallest Element in a BST

 

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个数就是第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:
    void zhongxu(TreeNode* root,int* a,int& i){
        if(!root) return;
        zhongxu(root->left,a,i);
        a[i++]=root->val;
        zhongxu(root->right,a,i);
    }
    int kthSmallest(TreeNode* root, int k) {
        int a[10000];
        int i=1;
        zhongxu(root,a,i);
        return a[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:
    void zhongxu(TreeNode* root,int& i,int& ans,int k){
        if(!root) return;
        zhongxu(root->left,i,ans,k);
        
        if(i++==k) ans=root->val;// i==k 时, 将答案存在来
        
        zhongxu(root->right,i,ans,k);
    }
    int kthSmallest(TreeNode* root, int k) {
        int i=1,ans;
        zhongxu(root,i,ans,k);
        return ans;
    }
};




非递归

/**
 * 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) {
        vector<int>v;
        stack<TreeNode*>s;
        TreeNode* p;
        
        s.push(root);
        while(!s.empty()){
            while(p=s.top())  // 向左走到尽头
                 s.push(p->left);
            s.pop();// 空指针出栈
            if(!s.empty()){
                p=s.top();//取栈顶元素
                s.pop();//栈顶元素出栈
                v.push_back(p->val);//加到向量vector中
                s.push(p->right);
            }
        }
        return v[k-1];
    }
};





版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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 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
  • 281

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

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

【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

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

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