[LeetCode]230. Kth Smallest Element in a BST

Problem Description

[https://leetcode.com/problems/kth-smallest-element-in-a-bst/]
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.

思路

既然可能找很多遍，不如直接做一个有序的数组来存

Code

package q230;

import java.util.ArrayList;
import java.util.List;

import TreeNode.*;

public class Solution {
    public int kthSmallest(TreeNode root, int k) {
        List<Integer> q = new ArrayList<Integer>();
        helper(root, q);

        return q.get(k - 1);

    }

    public void helper(TreeNode root, List<Integer> q) {
        if (root == null)
            return;
        helper(root.left, q);
        q.add(root.val);
        helper(root.right, q);
    }
}