Graph Theory37 sections · 1633 units
Open in CourseQuiz: Technique Selection
Knowledge check
Check Your Understanding
You need to compute the size of every subtree in a rooted tree. What's the most efficient approach?
- A.Run BFS from each node separately
- B.Floyd-Warshall on the tree
- C.Single DFS with post-order processing
- D.Binary search on subtree sizes