Algorithms.
node (include this node)). Compute bound of next level node. If bound is more than max, then add next level node to Q.(Upper Bound of the maximum Profit in subtree of this node) Consider the case when next level node is not considered as part of solution and add a node to queue with level as next,