Given a Undirected Weighted Tree having N nodes and E edges. Given Q queries, with each query indicating a starting node. The task is to print the sum of the distances from a given starting node S to every leaf node in the Weighted Tree.
Input: N = 5, E = 4, Q = 3
(4) / \ (2)
(5)/ \ (3)
Query 1: S = 1
Query 2: S = 3
Query 3: S = 5
The three leaf nodes in the tree are 3, 4 and 5.
For S = 1, the sum of the distances from node 1 to the leaf nodes are: d(1, 4) + d(1, 3) + d(1, 5) = 4 + (2 + 5) + (2 + 3) = 16.
For S = 3, the sum of the distances from node 3 to its leaf nodes are: d(3, 4) + d(3, 3) + d(3, 5) = (3 + 2 + 4) + 0 + (3 + 5) = 17
For S = 5, the sum of the distances from node 5 to its leaf nodes are: d(5, 4) + d(5, 3) + d(5, 5) = (5 + 2 + 4) + (5 + 3) + 0 = 19
Input: N = 3, E = 2, Q = 2
(9) / \ (1)
Query 1: S = 1
Query 2: S = 2
Query 3: S = 3
For each query, traverse the entire tree and find the sum of the distance from the given source node to all the leaf nodes.
Time Complexity: O(Q * N)
Efficient Approach: The idea is to use pre-compute the sum of the distance of every node to all the leaf nodes using Dynamic Programming on trees Algorithm and obtain the answer for each query in constant time.
Follow the steps below to solve the problem:
- Initialize a vector dp to store the sum of the distances from each node i to all the leaf nodes of the tree.
- Initialize a vector leaves to store the count of the leaf nodes in the sub-tree of node i considering 1 as the root node.
- Find the the sum of the distances from node i to all the leaf nodes in the sub-tree of i considering 1 as the root node using a modified Depth First Search Algorithm.
Let node a be the parent of node i
- leaves[a] += leaves[i] ;
- dp[a] += dp[i] + leaves[i] * weight of edge between nodes(a, i) ;
- Use the re-rooting technique to find the distance of the remaining leaves of the tree that are not in the sub-tree of node i. To calculate these distances, use another modified Depth First Search (DFS) algorithm to find and add the sum of the distances of leaf nodes to node i.
Let a be the parent node and i be the child node, then
Let the number of leaf nodes outside the sub-tree i that are present in the sub-tree a be L
- L = leaves[a] – leaves[i] ;
- dp[i] += ( dp[a] – dp[i] ) + ( weight of edge between nodes(a, i) ) * ( L – leaves[i] ) ;
- leaves[i] += L ;
Below is the implementation of the above approach:
16 17 19
Time Complexity: O(N + Q)
Auxiliary Space: O(N)
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.
- Check whether a node is leaf node or not for multiple queries
- Find GCD of each subtree of a given node in an N-ary Tree for Q queries
- Find distance from root to given node in a binary tree
- Farthest distance of a Node from each Node of a Tree
- Find parent of each node in a tree for multiple queries
- Print all nodes that are at distance k from a leaf node
- Closest leaf to a given node in Binary Tree
- Delete the last leaf node in a Binary Tree
- Deepest left leaf node in a binary tree
- Print the nodes of binary tree as they become the leaf node
- Number of leaf nodes in the subtree of every node of an n-ary tree
- Find farthest node from each node in Tree
- Deepest right leaf node in a binary tree | Iterative approach
- Minimum time to burn a Tree starting from a Leaf node
- Deepest left leaf node in a binary tree | iterative approach
- Create a binary tree from post order traversal and leaf node array
- Distance between two nodes of binary tree with node values from 1 to N
- Queries to find distance between two nodes of a Binary tree
- Find distance between two nodes in the given Binary tree for Q queries
- Find depth of the deepest odd level leaf node
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.