第11题 Search Range in Binary Search Tree

CMYing85

于 2021-05-03 14:01:53 发布

阅读量74

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/caomengying/article/details/116376455

算法专栏收录该内容

232 篇文章

订阅专栏

本文介绍了一种在二叉搜索树中查找指定区间内所有节点值的方法，并通过递归方式实现了这一功能。该算法返回指定区间内的所有节点值，并确保结果按升序排列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Search Range in Binary Search Tree

Description
Given a binary search tree and a range [k1, k2], return node values within a given range in ascending order.

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */

public class Solution {
    /**
     * @param root: param root: The root of the binary search tree
     * @param k1: An integer
     * @param k2: An integer
     * @return: return: Return all keys that k1<=key<=k2 in ascending order
     */
    public List<Integer> searchRange(TreeNode root, int k1, int k2) {
        // write your code here
        ArrayList<Integer> results = new ArrayList<>();
        if(root == null){
           return results;
        }
        List<Integer> left = searchRange(root.left, k1, k2);
        List<Integer> right = searchRange(root.right, k1, k2);
        if (root.val <= k2 && root.val >= k1){
            results.add(root.val);
        }
        results.addAll(left);
        results.addAll(right);
        Collections.sort(results);
        return results;

    }
}