##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Range operations
With Euler tour, subtree operations become range operations: Subtree sum of v: query range Update node v: update position Add x to all nodes in subtree of v: range update Build a segment tree on the tour array.
Each node's value is stored at its position. Time: for tour construction, per query/update. Space: .
