Kth Smallest Element in a BST
来源:互联网 发布:炉石传说mac版2017 编辑:程序博客网 时间:2024/05/16 18:27
Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest
to find thekth 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: int kthSmallest(TreeNode* root, int k) { vector<int> res; LeftB(root,res); return res[k-1]; } void LeftB(TreeNode* root,vector<int>& res){ if(root->left)LeftB(root->left,res); res.push_back(root->val); if(root->right)LeftB(root->right,res); }};
0 0
- #leetcode#Kth Smallest Element in a BST
- 230.Kth Smallest Element in a BST
- leetcode--Kth Smallest Element in a BST
- Kth Smallest Element in a BST
- Kth Smallest Element in a BST
- Leetcode|Kth Smallest Element in a BST
- Kth Smallest Element in a BST
- [leetcode] Kth Smallest Element in a BST
- 【LeetCode】Kth Smallest Element in a BST
- Kth Smallest Element in a BST
- LeetCode Kth Smallest Element in a BST
- Kth Smallest Element in a BST
- 【leetcode】Kth Smallest Element in a BST
- Kth Smallest Element in a BST
- Kth Smallest Element in a BST
- LeetCode Kth Smallest Element in a BST
- Kth Smallest Element in a BST
- leetcode: Kth Smallest Element in a BST
- 打开Mac OSX原生的NTFS功能
- Java 泛型
- SQLSERVER的字段类型说明
- 【leetcode】14. Longest Common Prefix
- 一、操作系统原理之1
- Kth Smallest Element in a BST
- c# 数字图像处理的一些方法
- mysql数据库中批量更新
- 文件与IO(二)之字符流
- 一些图像处理的数据集
- Fifth-自动旋转和自动调整大小
- 计算机视觉、机器学习相关领域论文和源代码大集合--持续更新……
- C#编程基础 实验(10) (5)
- MaterialDesign之Dialog