DIY: Range Sum of BST
Explore how to compute the sum of node values between specified limits in a binary search tree using Elixir. This lesson helps you understand practical use of data structures and algorithms to solve real Amazon coding interview questions by implementing a range sum function with precise node inclusion criteria.
We'll cover the following...
We'll cover the following...
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 ...