Chapter 46: Tree, Graph, Bitmask and Digit Dynamic Programming
46.02Intermediate / Advanced4 topics

Rerooting problems

Part of Chapter 46: Tree, Graph, Bitmask and Digit Dynamic Programming.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

46.02.1

Sum of distances from each node

Explanation coming soon.

46.02.2

Best root

Explanation coming soon.

46.02.3

Diameter endpoints

Explanation coming soon.

46.02.4

Rerooting memoization

Explanation coming soon.