DIY: Range Sum of BST
Explore how to implement a function that sums node values within a specified range in a binary search tree. This lesson helps you understand BST traversal and apply it to a real Amazon interview problem, improving your problem-solving skills in Kotlin.
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 ...