Sum of Search-Tree Keys Within a Range
Asked at Meta · Coding Questions · Difficulty: Easy
You are given a binary search tree of integer keys and an inclusive range `[low, high]`. Return the sum of every key in the tree that lies inside the range.
Loading the problem…
More Meta interview questions
- LLM conceptual questions
- Implement a Two-Hidden-Layer MLP with Backpropagation in NumPy
- Dot Product with Run-Length Encoded Vectors
- Count Lakes Wrapped by a Given Island
- Minimum Remove to Make Valid Parentheses
- LLM with Beam Search and Nucleus Sampling (Meta MSL)