3 ms·
Isn't that just the classic graph coloring problem though? A tree is just a type of graph.
by bogomipz 8y ago
Isn't that just the classic graph coloring problem though? A tree is just a type of graph.
- chillee 8y agoWell, A. Not exactly because there's no restrictions on when you can color nodes black, and B. Graph coloring in general is NP-complete while this problem has an O(n) solution.