def query(self, root, s, e):
        if not root:
            return DEFAULT

        if s <= root.start and e >= root.end:
            return root.count

        if s > root.end or e < root.start:
            return DEFAULT

        l = self.query(root.left, s, e)
        r = self.query(root.right, s, e)
        return f(l, r)
Send event to peer
dataset/ETHPy150Open algorhythms/LintCode/Segment Tree Query II.py/Solution.query--crossover with--dataset/ETHPy150Open circuits/circuits/circuits/node/node.py/Node.__on_remote