Code already started:

def rangeSum(root, min_val, max_val): return 0

In Python can you show code with comments

1. Range Sum Given the root node of a binary search tree (with no duplicates), return the sum of values of all nodes with value between minVal and maxVal (inclusive). Example: Given the root of the following tree 7 3 10 // -1 5 9 12 10 = 34 When, minval=2 & maxVal=10 + 3 + 5 7 + 9 + When, minval=3 & maxval=8 + 3 + 5 + 7 = 15 When, minval=10 & maxVal=20 + 10 + 12 = 22 When, minval=20 & maxVal=30 0