Tag: tree

2 posts

DSA Flatten a tree into an array using DFS timestamps — subtree queries become range queries, and you can throw a segment tree at them.

DSA How to jump up a tree in powers of two — kth ancestors, lowest common ancestors, and path distances, all in O(log n) per query.