[Leetcode] 230. Kth Smallest Element in a BST
2017-01-12 15:09
323 查看
题目：
题意： 给定一个二叉搜索树，求树中最小的第K个元素
思路： 对树进行中序遍历得到是会是有序的从小到大的结果，直接取中序遍历结果的第k元素就是结果
具体代码：
题意： 给定一个二叉搜索树，求树中最小的第K个元素
思路： 对树进行中序遍历得到是会是有序的从小到大的结果，直接取中序遍历结果的第k元素就是结果
具体代码：
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
List<Integer> list = new ArrayList<>();
public int kthSmallest(TreeNode root, int k) {
preOrder(root);
return list.get(k-1);
}
public void preOrder(TreeNode root){
if(root == null){
return;
}
preOrder(root.left);
list.add(root.val);
preOrder(root.right);
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode刷题，没想到这么难搞！
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解