LintCode:线段树的构造

最新推荐文章于 2021-01-23 14:13:32 发布

zyaphone

最新推荐文章于 2021-01-23 14:13:32 发布

阅读量307

点赞数

CC 4.0 BY-SA版权

分类专栏： lintcode python

本文链接：https://blog.youkuaiyun.com/u012225151/article/details/51355172

lintcode 同时被 2 个专栏收录

139 篇文章

订阅专栏

python

116 篇文章

订阅专栏

本文详细介绍了线段树的数据结构及其实现方法，通过具体的Python代码实现了一个基本的线段树构建过程。从节点定义到递归构建，一步步解析线段树的核心思想。

LintCode:线段树的构造

"""
Definition of SegmentTreeNode:
class SegmentTreeNode:
    def __init__(self, start, end):
        self.start, self.end = start, end
        self.left, self.right = None, None
"""

class Solution: 
    # @param start, end: Denote an segment / interval
    # @return: The root of Segment Tree
    def build(self, start, end):
        # write your code here
        if start > end:
            return None
        root = SegmentTreeNode(start, end)
        self.pre_order(root)
        return root

    def pre_order(self, root):
        if root.start == root.end:
            return
        root.left = SegmentTreeNode(root.start, (root.start + root.end)/2)
        root.right = SegmentTreeNode((root.start + root.end)/2 + 1, root.end)
        self.pre_order(root.left)
        self.pre_order(root.right)