FilesExpand file tree

 master

/

52-4.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

23 lines (21 loc) · 707 Bytes

 master

/

52-4.py

Copy path

Top

File metadata and controls

• Code
• Blame

23 lines (21 loc) · 707 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

# Definition for a binary tree node.

class TreeNode:

def __init__(self, x):

self.val = x

self.left = None

self.right = None

class Solution:

def rangeSumBST(self, root: TreeNode, L: int, R: int) -> int:

stack, sum = [root], 0

# 큐 연산을 이용해 반복 구조 BFS로 필요한 노드 탐색

위에 설명과 마찬가지

while stack:

node = stack.pop(0)

if node:

if node.val > L:

stack.append(node.left)

if node.val < R:

stack.append(node.right)

if L <= node.val <= R:

sum += node.val

return sum