You are viewing a single comment's thread. Return to all comments →
Just a note on your complexity calculation: a tree will always have V-1 edges, thus O(V).
Cut the Tree
You are viewing a single comment's thread. Return to all comments →
Just a note on your complexity calculation: a tree will always have V-1 edges, thus O(V).