For a full tree, I want to find a set A = {a1,a2,...,an},
for each ai(i=1,...n):
Union of every leaf nodes set of each ai is the leaf node set of the
root node.
Each leaf node set of ai and aj has no intersection.
For example:
For the following tree:
n0
/ \
n1 n2
Such set would be :{n0} {n1,n2};
For such tree:
n0
/ \
n1 n2
/ \ / \
n3 n4 n5 n6
Such set would be: {n0} {n1,n2},{n3,n4,n5,n6},{n1,n5,n6},{n3,n4,n2}
Therefore, I want to know how many such set would be for a full n-ary
tree.
Thanks.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
