Tree traversal sum problem keeping maximisation in mind
up vote
0
down vote
favorite
see the below given N-ary tree..
given the above tree, we need to sum in such a way that if a child is bigger than parent then parent value will be considered in total sum
so the total comes to be = 22
the above steps can be achieved with BFS traversal.
Now the question.
before calculating sum I can mark any child a hero, which means it will not get affected by the parent value and child's value will be taken in total sum.
how to choose child such that total sum gets maximized when the total number of mark limit is given
tree maximization
asked Nov 11 at 13:39
rajiv
116
add a comment |
up vote
0
down vote
favorite
see the below given N-ary tree..
given the above tree, we need to sum in such a way that if a child is bigger than parent then parent value will be considered in total sum
so the total comes to be = 22
the above steps can be achieved with BFS traversal.
Now the question.
before calculating sum I can mark any child a hero, which means it will not get affected by the parent value and child's value will be taken in total sum.
how to choose child such that total sum gets maximized when the total number of mark limit is given
tree maximization
asked Nov 11 at 13:39
rajiv
116
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
see the below given N-ary tree..
given the above tree, we need to sum in such a way that if a child is bigger than parent then parent value will be considered in total sum
so the total comes to be = 22
the above steps can be achieved with BFS traversal.
Now the question.
before calculating sum I can mark any child a hero, which means it will not get affected by the parent value and child's value will be taken in total sum.
how to choose child such that total sum gets maximized when the total number of mark limit is given
tree maximization
asked Nov 11 at 13:39
rajiv
116
see the below given N-ary tree..
given the above tree, we need to sum in such a way that if a child is bigger than parent then parent value will be considered in total sum
so the total comes to be = 22
the above steps can be achieved with BFS traversal.
Now the question.
before calculating sum I can mark any child a hero, which means it will not get affected by the parent value and child's value will be taken in total sum.
how to choose child such that total sum gets maximized when the total number of mark limit is given
tree maximization
tree maximization
asked Nov 11 at 13:39
rajiv
116
asked Nov 11 at 13:39
rajiv
116
edited Nov 11 at 17:04
asked Nov 11 at 13:39
rajiv
116
asked Nov 11 at 13:39
rajiv
116
asked Nov 11 at 13:39
rajiv
116
116
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53249316%2ftree-traversal-sum-problem-keeping-maximisation-in-mind%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
