算法第十题（二叉树）

297. 二叉树的序列化与反序列化

class Codec:

    def serialize(self, root):

        s = ""
        queue = []
        queue.append(root)
        while queue:
            root = queue.pop(0)
            if root:
                s += str(root.val)
                queue.append(root.left)
                queue.append(root.right)
            else:
                s += "n"
            s += " "        
        return s

    def deserialize(self, data):
 
        tree = data.split()
        print(tree)
        if tree[0] == "n":
            return None
        queue = []
        root = TreeNode(int(tree[0]))
        queue.append(root)
        i = 1
        while queue:
            cur = queue.pop(0)
            if cur == None:
                continue
            cur.left = TreeNode(int(tree[i])) if tree[i] != "n" else None
            cur.right = TreeNode(int(tree[i + 1])) if tree[i + 1] != "n" else None
            i += 2
            queue.append(cur.left)
            queue.append(cur.right)
        return root

序列化与反序列化的最好用广度优先搜索（层序遍历比较好）

938. 二叉搜索树的范围和

# 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:
        if root is None:
            return
        self.sum = 0
        self.dfs(root,L,R)
        return self.sum

    def dfs(self, root, L, R):
        if root:
            if root.val >= L and root.val <= R:
                self.sum += root.val
            if root.val > L:
                self.dfs(root.left,L,R)
            if root.val < R:
                self.dfs(root.right,L,R)

二叉搜索树都是利用其排序的性质做文章。