Range Sum of BST

Easy Binary Search Tree

Given a BST (level-order form) and two integers low and high, print the sum of all node values in the inclusive range [low, high].

Constraints

1 <= number of nodes <= 2 * 10^4 All values are unique

No discussions yet.