Kth Smallest Element in a BST

原创 2015年07月09日 00:08:55

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?

/**
 * 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 traverse(TreeNode* root, int k, int& i, int& val)
    {
    	if(root == NULL || i > k)
    	{
    		return;
    	}
    	traverse(root -> left, k, i, val);
    	++ i;
    	if(i == k)
    	{
    		val = root -> val;
    	}
    	traverse(root -> right, k, i, val);
    }
    int kthSmallest(TreeNode* root, int k)
    {
    	int i = 0;
    	int val = 0;
    	traverse(root, k, i, val);
    	return val;
    }
};
/**
 * 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 findK(TreeNode* root, int k, int& N, int& num)
    {
    	if(root == NULL)
    	{
    		return;
    	}

   		findK(root -> left, k, N, num);
   		if(N >= k)
   		{
   			return;
   		}
   		++N;
   		if(N == k)
   		{
   			num = root -> val;
   			return;
   		}
   		findK(root -> right, k, N, num);
   		if(N >= k)
   		{
   			//num = root -> val;
   			return;
   		}
    	
    }
    int kthSmallest(TreeNode* root, int k) {
        int num = 0;
        int N = 0;
        findK(root, k, N, num);
        return num;
    }
};



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

相关文章推荐

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

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

[leetcode] Kth Smallest Element in a BST

题目链接在此 Given a binary search tree, write a function kthSmallest to find the kth smallest elemen...

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

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

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

Kth Smallest Element in a BST - leetcode 230号题目个人题解

Kth Smallest Element in a BST - leetcode 230号题目个人题解题目要求Given a binary search tree, write a function ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Kth Smallest Element in a BST
举报原因:
原因补充:

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