codeVader

November Challenge

Problem

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

It simply calculate the sum for those between the given high and low value.

Solution I

This is a binary search tree, which means that…

--

--