Search⌘ K
AI Features

DIY: Range Sum of BST

Understand how to traverse a binary search tree to calculate the sum of node values within a specified range. This lesson helps you master an essential technique for solving similar range-based problems in coding interviews.

Problem statement

For this challenge, you are given the root node of a binary search tree and two values: low and high. Your task is to return the sum of the values of all nodes in BST that are value between ...