LeetCode算法题938解题思路
原题
938. Range Sum of BST
Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive).
The binary search tree is guaranteed to have unique values.
Example 1:
1 | Input: root = [10,5,15,3,7,null,18], L = 7, R = 15 |
Example 2:
1 | Input: root = [10,5,15,3,7,13,18,1,null,6], L = 6, R = 10 |
Note:
- The number of nodes in the tree is at most 10000.
- The final answer is guaranteed to be less than 2^31.
解题思路
这题给的二叉树既不是最小堆也不是最大堆，所以能想到的方法就是递归遍历整棵树了。
代码实现
Golang实现
https://github.com/cook-coder/my-leetcode-solution/tree/master/easy/938
成绩
