当前位置：网站首页>LeetCode 938. Range Sum of Binary Search Trees (Simple)

LeetCode 938. Range Sum of Binary Search Trees (Simple)

2022-08-10 05:55:00 【Shengxin Research Ape】

pyhton preorder traversal

# Definition for a binary tree node.# class TreeNode:# def __init__(self, val=0, left=None, right=None):# self.val = val# self.left = left# self.right = rightclass Solution:def rangeSumBST(self, root: Optional[TreeNode], low: int, high: int) -> int:self.count = 0if root==None:return Noneself.inorder(root,low,high)return self.countdef inorder(self,root,low,high):p = rootif p==None:returnif(p.val>=low and p.val<=high):self.count +=p.valself.inorder(p.left,low,high)self.inorder(p.right,low,high)