Given a binary tree and a budget. Assume you are at the root of the tree (level 1), you need to maximise the count of leaf nodes you can visit in your budget if the cost of visiting a leaf node is ...
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community. Issues are used to track todos, bugs, feature requests, and more.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results