🥉

Range Sum of BST

Created

2021/12/17 07:36

문제 번호

938

카테고리

Tree

Depth-First Search

Binary Search Tree

Binary Tree

Range Sum of BST - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

https://leetcode.com/problems/range-sum-of-bst/

Code

제출 날짜	시간	메모리
2021/12/17	88 ms	9.7 MB

// 938. Range Sum of BST
//
// https://leetcode.com/problems/range-sum-of-bst/

// Definition for a binary tree node.
// type TreeNode struct {
//     Val int
//     Left *TreeNode
//     Right *TreeNode
// }

// accumulate function accumulate the sum of the given range.
// The given range is inclusive.
// [7, 15] means 7<= x <= 15.
func rangeSumBST(root *TreeNode, low int, high int) int {
	sum := 0
	if root == nil {
		return sum
	}
	if low <= root.Val && root.Val <= high {
		sum += root.Val
	}
	sum += rangeSumBST(root.Left, low, high)
	sum += rangeSumBST(root.Right, low, high)
	return sum
}
Go
복사