found better upper bound for number of outgoing edges of an active node

use k instead of n
however, an even better bound would be k-u_i because at least u_i nodes
 are above the current node in the tree
This works better than using just k when k is small, worse when k is large