Find a tree with the given values and print the edges of the tree. Print “-1”, if the tree is not possible.
Given three integers n, d and h.
n -> Number of vertices. [1, n] d -> Diameter of the tree (largest distance between two vertices). h -> Height of the tree (longest distance between vertex 1 and another vertex)
Input : n = 5, d = 3, h = 2 Output : 1 2 2 3 1 4 1 5 Explanation :
We can see that the height of the tree is 2 (1 -> 2 --> 5) and diameter is 3 ( 3 -> 2 -> 1 -> 5). So our conditions are satisfied. Input : n = 8, d = 4, h = 2 Output : 1 2 2 3 1 4 4 5 1 6 1 7 1 8 Explanation :
- Observe that when d = 1, we cannot construct a tree (if tree has more than 2 vertices). Also when d > 2*h, we cannot construct a tree.
- As we know that height is the longest path from vertex 1 to another vertex. So build that path from vertex 1 by adding edges up to h. Now, if d > h, we should add another path to satisfy diameter from vertex 1, with a length of d – h.
- Our conditions for height and diameter are satisfied. But still some vertices may be left. Add the remaining vertices at any vertex other than the end points. This step will not alter our diameter and height. Chose vertex 1 to add the remaining vertices (you can chose any).
- But when d == h, choose vertex 2 to add the remaining vertices.
1 2 2 3 1 4 1 5
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.
- Make a tree with n vertices , d diameter and at most vertex degree k
- Diameter of an N-ary tree
- Diameter of a tree using DFS
- Diameter of a Binary Tree in O(n) [A new method]
- Diameter of n-ary tree using BFS
- DP on Trees | Set-3 ( Diameter of N-ary Tree )
- Diameter of a Binary Indexed Tree with N nodes
- Finding the lexicographically smallest diameter in a binary tree
- Diameter of a Binary Tree
- Check if a given Binary Tree is height balanced like a Red-Black Tree
- Right sibling of each node in a tree given as array of edges
- Find number of edges that can be broken in a tree such that Bitwise OR of resulting two trees are equal
- Number of edges in mirror image of Complete binary tree
- Number of edges in a perfect binary tree with N levels
- Color tree with minimum colors such that colors of edges incident to a vertex are different
- Minimum Operations to make value of all vertices of the tree Zero
- Maximize the sum of products of the degrees between any two vertices of the tree
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- Minimum cost to colour a Tree with no 3 adjacent vertices having same colour
- Check if a path exists in a tree with K vertices present or are at most at a distance D
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.