Package g0901_1000.s0938_range_sum_of_bst

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    938 - Range Sum of BST.

    Easy

    Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high].

    Example 1:

    Input: root = 10,5,15,3,7,null,18, low = 7, high = 15

    Output: 32

    Explanation: Nodes 7, 10, and 15 are in the range 7, 15. 7 + 10 + 15 = 32.

    Example 2:

    Input: root = 10,5,15,3,7,13,18,1,null,6, low = 6, high = 10

    Output: 23

    Explanation: Nodes 6, 7, and 10 are in the range 6, 10. 6 + 7 + 10 = 23.

    Constraints:

    • The number of nodes in the tree is in the range <code>1, 2 * 10<sup>4</sup></code>.

    • <code>1 <= Node.val <= 10<sup>5</sup></code>

    • <code>1 <= low <= high <= 10<sup>5</sup></code>

    • All Node.val are unique.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer rangeSumBST(TreeNode root, Integer low, Integer high)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait