<del id="s8kao"></del>

<fieldset id="s8kao"></fieldset>

[LintCode] Search Range in Binary Search Tree

draveness 發布于2019-08-14 15:12 / 2102人閱讀

摘要：重點是根據的性質，先左后根最后右。另一重點是，函數和函數都要用的的參數，記得在函數外層定義。

Problem

Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Find all the keys of tree in range k1 to k2. i.e. print all x such that k1<=x<=k2 and x is a key of given BST. Return all the keys in ascending order.

Example

If k1 = 10 and k2 = 22, then your function should return [12, 20, 22].

Note

重點是：根據BST的性質，先左后根最后右。
另一重點是，helper函數和main函數都要用的的參數，記得在main函數外層定義。

Solution

public class Solution {
    private ArrayList result;
    public ArrayList searchRange(TreeNode root, int k1, int k2) {
        // write your code here
        result = new ArrayList();
        Searchfunc(root, k1, k2);
        return result;
    }
    public void Searchfunc(TreeNode root, int k1, int k2) {
        if (root == null) {
            return;
        }
        if (root.val > k1) {
            Searchfunc(root.left, k1, k2);
            }
        if (root.val >= k1 && root.val <= k2) {
            result.add(root.val);
        }
        if (root.val < k2) {
            Searchfunc(root.right, k1, k2);
        }
    }
}

云服務器 GPU云服務器 binary-search-tree binary-search binary-tree search

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/65455.html

[LintCode] Remove Node in Binary Search Tree [理解BS

Problem Given a root of Binary Search Tree with unique value for each node. Remove the node with given value. If there is no such a node with given value in the binary search tree, do nothing. You sho...

陳江龍 2019-08-14 15:33 評論0 收藏0
[LintCode] Insert Node in a Binary Search Tree

摘要：建立兩個樹結點，先用找到在的位置，讓作為的根節點找到的位置后，指向。此時，用代替與連接就可以了。 Problem Given a binary search tree and a new tree node, insert the node into the tree. You should keep the tree still be a valid binary search tr...

Taste 2019-08-14 15:33 評論0 收藏0
[LintCode] Binary Search Tree Iterator

摘要：建立一個堆棧，先將最左邊的結點從大到小壓入棧，這樣的話，為了實現迭代即返回下一個的函數就要考慮右邊的結點。如此，實現函數。 Problem Design an iterator over a binary search tree with the following rules: Elements are visited in ascending order (i.e. an in-o...

silencezwm 2019-08-14 15:33 評論0 收藏0
[LintCode/LeetCode] Search for a Range [左右邊界法/一次循環

摘要：首先，建立二元結果數組，起點，終點。二分法求左邊界當中點小于，移向中點，否則移向中點先判斷起點，再判斷終點是否等于，如果是，賦值給。 Problem Given a sorted array of n integers, find the starting and ending position of a given target value. If the target is not...

zhangrxiang 2019-08-14 15:41 評論0 收藏0
Search Range in BST

Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Find all the keys of tree in range k1 to k2. i.e. print all x such that k1 k2root >= left bound ----> search unti...

godruoyi 2019-08-14 17:07 評論0 收藏0