2021-06-09

leetcode938-DFS，递归and非递归解法

---

题目描述

938. 二叉搜索树的范围和
     给定二叉搜索树的根结点 root，返回值位于范围 [low, high] 之间的所有结点的值的和。

示例 1：

输入：root = [10,5,15,3,7,null,18], low = 7, high = 15
输出：32
示例 2：

输入：root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10
输出：23

提示：

树中节点数目在范围 [1, 2 * 104] 内
1 <= Node.val <= 105
1 <= low <= high <= 105
所有 Node.val 互不相同

---

1.解题思路

利用中序遍历方法，进行题解。

代码

# 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 = right
class Solution:
    def rangeSumBST(self, root: TreeNode, low: int, high: int) -> int:
        self.count=0
        self.start=False
        self.DFS(root,low,high)
        return self.count
    def DFS(self,root,low,high):
        if root.left !=None:
            self.DFS(root.left,low,high)
        #中序遍历
        if root.val ==low:
            self.start=True
        if self.start:
            self.count+=root.val
        if root.val==high:
            self.start=False
        if root.right !=None:
            self.DFS(root.right,low,high)

---

2.解题思路

栈、中序遍历、非递归

代码

# 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 = right
class Solution:
    def rangeSumBST(self, root: TreeNode, low: int, high: int) -> int:
        self.count=0
        self.start=False
        self.DFS(root,low,high)
        return self.count
    def DFS(self,root,low,high):
        stack=[]
        p=root
        while p!=None or len(stack)!=0:
            while p!=None:
                stack.append(p)
                p=p.left
            if len(stack)!=0:
                p=stack.pop()
                #访问
                ##开始访问条件
                if p.val==low:
                    self.start=True
                ##计数
                if self.start:
                    self.count+=p.val
                ##结束访问条件
                if p.val==high:
                    self.start=False
                p=p.right