GoCooL wrote:
> L7 wrote:
> > Suppose the following tree...
> >
> >       4
> >     /  \
> >    1   20
> >   / \  / \
> > 10  2 2   3
> >
> > You now have EVEN -> 21, ODD -> 21
> > However, if you take only the 10 and 20 nodes you get 30, with minimal
> > node selection as a bonus.
>
>
> The max would actually be !0 + 20 + 2 = 32, but still, what your saying
> is valid.
>

Well, I was assuming that same-level nodes (siblings) got marked as
adjacent. However, this was never explicitly stated by the OP (or
subsequently cleared up) so you got me. Nice ;-)


--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to