h******e
发帖数: 52 | 1 Was asked a very interesting tree problem.Given a tree and a number N,
construct another tree such that each node of the tree has either 0 or N
elements,except for one node which has between 0 to N elements.Only other
constraint is that ancestry is preserved in the new tree.
↳ | b********0
发帖数: 62 | 2 如果n elements意思是n children的话 像是一个满n叉树 |
|
