#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/euler-tour-technique/subtree-queries-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/euler-tour-technique/subtree-queries-implementation

Repovive

Subtree Queries - Implementation - Euler Tour Technique | Graph Theory | Repovive

Repovive.

Graph Theory37 sections · 1633 units81h total

Open in Course

Subtree Queries - Implementation

(Code and submit)

Compute Euler tour times with DFS. Build array mapping tin[v] to values. Build segment tree on this array. Pseudocode:

timer := 0

function dfs(v, parent):
    tin[v] := timer
    timer := timer + 1
    for child in adj[v]:
        if child != parent then
            dfs(child, v)
    tout[v] := timer

Complexity: $O(n)$ preprocessing, $O(\log n)$ per query.

Space complexity is $O(n)$ for the data structures used.