[−][src]Module algorithms_edu::algo::graph::tree::rooting
Often when working with trees we are given them as a graph with undirected edges, however sometimes a better representation is a rooted tree.
- Time Complexity: O(V+E)
Resources
Structs
TreeNode |