Leetcode 938. Range Sum of BST

Given the root of a binary search tree and an inclusive range [low, high], return the sum of all node values that fall within the range. Leverage the BST ordering to prune subtrees that are entirely < low or > high and traverse only the relevant nodes.

Asked at:

Meta

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid December, 2025

Meta

Senior

Early October, 2025

Meta

Mid-level

Early August, 2025

Meta

Senior

Asked during phone screen

Get Premium to View All 10+ Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 938. Range Sum of BST

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact