Given a skewed tree (Every node has at most one child) with N nodes and K colors. You have to assign a color from 1 to K to each node such that parent and child has different colors. Find the maximum number of ways of coloring the nodes.
Input : N = 2, K = 2. Output : Let A1 and A2 be the two nodes. Let A1 is parent of A2. Colors are Red and Blue. Case 1: A1 is colored Red and A2 is colored Blue. Case 2: A1 is colored Blue and A2 is colored Red. No. of ways : 2 Input : N = 3, K = 3. Output : A1, A2, A3 are the nodes. A1 is parent of A2 and A2 is parent of A3. Let colors be R, B, G. A1 can choose any three colors and A2 can choose any other two colors and A3 can choose any other two colors than its parents. No. of ways: 12
Note that only the root and children (children, grand children, grand grand children …. and all) should have different colors. The root of the tree can choose any of the K colors so K ways. Every other node can choose other K-1 colors other than its parent. So every node has K-1 choices.
Here, we select the tree as every node as only one child. We can choose any of the K colors for the root of the tree so K ways. And we are left with K-1 colors for its child. So for every child we can assign a color other than its parent. Thus, for each of the N-1 nodes we are left with K-1 colors. Thus the answer is K*(K-1)^(N-1).
We can find the answer by using normal power function which takes O(N) time complexity. But for better time complexity we use Faster Exponentiation function which takes O(log N) time complexity.
This article is contributed by Harsha Mogali. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Color tree with minimum colors such that colors of edges incident to a vertex are different
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Ways to paint N paintings such that adjacent paintings don't have same colors
- Check whether a given binary tree is skewed binary tree or not?
- Convert a Binary Search Tree into a Skewed tree in increasing or decreasing order
- Count all Grandparent-Parent-Child Triplets in a binary tree whose sum is greater than X
- Sum of all parent-child differences in a Binary Tree
- Sum of all the child nodes with even parent values in a Binary Tree
- Skewed Binary Tree
- Sum of all the parent nodes having child node x
- Minimum steps to color the tree with given colors
- Number of ways to paint a tree of N nodes with K distinct colors with given conditions
- Check if quantities of 3 distinct colors can be converted to a single color by given merge-pair operations
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Ways to arrange Balls such that adjacent balls are of different types
- Ways of dividing a group into two halves such that two elements are in different groups
- Count of distinct colors in a subtree of a Colored Tree with given min frequency for Q queries
- Find Height of Binary Tree represented by Parent array
- Construct Binary Tree from given Parent Array representation
- Lowest Common Ancestor in a Binary Tree | Set 2 (Using Parent Pointer)