Consider a full $$n$$-tree, that is, a tree in which every node other than the leaves has $$n$$ children. The depth $$d$$ of a node is the level in the tree with the root node having depth 0, the children of the root node having depth 1, and the leave nodes having depth $$h$$. We also call $$h$$ the height of the tree.
Determine the betweeness centrality $$C_b(d)$$ for the nodes depending on their depth $$d$$.
