The correct answer is "N – 1". A tree with N nodes always has N - 1 edges. This is because in a tree, there is always exactly one path between any two nodes, and adding any additional edge would create a cycle, which contradicts the definition of a tree.

Question

Knowee AI · Accepted Answer

The correct answer is "N – 1". A tree with N nodes always has N - 1 edges. This is because in a tree, there is always exactly one path between any two nodes, and adding any additional edge would create a cycle, which contradicts the definition of a tree.

How many edges will a tree consisting of N nodes have? ans. N – 1 N Log(N) N + 1

Question

Solution

Similar Questions

Upgrade your grade with Knowee