Leetcode Problem 938. Range Sum of BST

938. Range Sum of BST

Leetcode Solutions

Start with the root node.
If the current node is null, return 0.
Initialize a variable sum to 0.
If the current node's value is within the range [low, high], add it to sum.
If the current node's value is greater than low, recursively call the function on the left child and add the result to sum.
If the current node's value is less than high, recursively call the function on the right child and add the result to sum.
Return the sum.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen