recursion with normal distrobution

I need some help with creating a unique form of binary tree. I will eventually drop 256 balls into this to see the distribution, but its creating a pascals triangle recursively.

To create it I need to use two classes, a tree and a node class, and friend them create it recursively. I have no idea how to do it at all.
What about this problem are you having trouble understanding? The recursive creation of the tree, the simulation of the balls falling, what each class is supposed to be for, or binary trees?

-Albatross
The recursive creation of the tree using the friended node and tree class. I'm pretty sure I understand how to use the created tree, but the creation of such a unique tree I don't know how to do it.
Topic archived. No new replies allowed.