Questions

HandsOn $>$ Max Or Min Tree

You have a tree containing $N$ nodes which is rooted at riode $1.$ In this tree every node i has a vafue of $A[i].$

You would be asked to traverse the tree starting froma node till you encounter a $$ leaf as per the following rules:

Next node to be traversed should be a child of the current node.

The chosen child should have either $e^{e^2}$ maximum or minimum of the values of all children.

For everys subsequent traversal, you need to swap the choice of minimut or of

You could forego the swap restriction at most once.

Yourobjective is to maximize the sum of the values of the traversed nodes $($including starting node.$)$