Given a tree (not a binary tree), where each node in the tree has an integer value You are required to find the maximum sum for values of nodes under the constraint that the sum cannot contain both a node and its parent node Describe an algorithm that maximizes the sum of values of the selected nodes in the tree Hint the node structure will hold a vector of node pointers representing the children and two additional integers one for the value and another for the index of the node and a pointer to parent node (optional) You are required to answer the question above using dynamic programming (c code) Input Format The first line will contain the number of nodes in the tree N The following N space separated numbers will contain the data in each node The following N 1 lines represents edges and will contain 2 values each Index of the parent Index of the child Constraints 1 N 10 5 For each value vi 1 vi 10 8 Output Format The sum of values of the selected nodes Output Format The sum of values of the selected nodes Sample Input o 8 4 2 3 60 4 15 5 10 0 1 02 03 l 4 1 5 36 37 Sample Output 0 82 Explanation 0 The selected nodes to maximize the sum are highlighted in the following figure 4 2 3 60 4 15 5 10

The Answer is in the image, click to view ...

Question: Given a tree (not a binary tree), where each node in the tree has an integer value. You are required to find the maximum sum

Given a tree (not a binary tree), where each node in the tree has an integer value. You are required to find the maximum sum for values of nodes under the constraint that the sum cannot contain both a node and its parent node. Describe an algorithm that maximizes the sum of values of the selected nodes in the tree.

Hint: the node structure will hold a vector of node pointers representing the children and two additional integers; one for the value and another for the index of the node and a pointer to parent node (optional).

You are required to answer the question above using dynamic programming.(c++ code)

Input Format

The first line will contain the number of nodes in the tree N.
The following N space-separated numbers will contain the data in each node.
The following N-1 lines represents edges and will contain 2 values each:
- Index of the parent.
- Index of the child.

Constraints

1 N 10^5
For each value vi: 1 vi 10^8

Output Format

The sum of values of the selected nodes. Given a tree (not a binary tree), where each node in the

Output Format The sum of values of the selected nodes. Sample Input o 8 4 2 3 60 4 15 5 10 0 1 02 03 l 4 1 5 36 37 Sample Output 0 82 Explanation 0 The selected nodes to maximize the sum are highlighted in the following figure. 4 2 3 60 4 15 5 10

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

3. [11 marks] A leaf-to-root node path is a sequence of connected nodes v,2, ..., vk where vi is a leaf and Uk is the root of a tree. Consider the problem! we will call the maximum-sum leaf-to-root...

3. [11 marks A leaf-to-root node path is a sequence of connected nodes V1, v2,... , vk where vi is a leaf and vk is the root of a tree. Consider the problem we will call the maximum-sum leaf-to-root...

3. 11 marks A leaf-to-root node path is a sequence of connected nodes v1, v2,... , vk where vi is a leaf and vk is the root of a tree. Consider the problem we will call the maximum-sum leaf-to-root...

3. [11 marks] A leaf-to-root node path is a sequence of connected nodes v, v2, , Vk where vi is a leaf and vk is the root of a tree. Consider the problem we will call the maximum-sum leaf-to-root...

3. [11 marks A leaf-to-root node path is a sequence of connected nodes V1, 02,.. . , Vk where vi is a leaf and vk is the root of a tree. Consider the problem we will call the maximum-sum leaf-to-root...

3. [11 marks] A leaf-to-root node path is a sequence of connected nodes v1,v2,... , vk where vi is a leaf and vk is the root of a tree. Consider the problem we will call the maximum-sum leaf-to-root...

2. 6 marks] Max-Tree Value. Consider the problem we will call the mar-tree value problem (MTV): Given as input the root r of a tree (that is not necessarily binary) in which every node in the tree...

Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree. For the following BST and k=3, the expected output is 4...

The mean life of a certain brand of auto batteries is 44 months with a standard deviation of 3 months. Assume that the lives of all auto batteries of this brand have a bell-shaped distribution. Using...

2 The balance in Ferndale Construction Company's check register May 31 was $12,583.40. The bank statement for Ferndale Construction Company listed the following information: Previous balance (May 1)...

5. What has happened to our personal savings rate in recent years, and how has that affected our level of investment?

Scenario: A Multi-national Corporation called The Globe has created a subsidiary called Thirst in an under-developed country called non-potable waters. This hosting country suffers from a severe...

9. Describe the characteristics of power.

5. The month of Ramadan, a month of fasting for Muslims, ends with which holiday? a. Eid ul-Fitr b. Allahu Akbar c. Takbir d. Abu Bakr

2. What is the name of the dish that features black-eyed peas and rice (although sometimes collards, ham hocks, stewed tomatoes, or other items) and is served in the South, especially on New Years...