Complete binary tree

Write a C++ program that creates a random complete binary tree. To pick a leaf at random, you should count the leaves. Then generate a random integer in the range 1 to the current number of leaves. And then go to te corresponding leaf. Your code should prompt the user for the number of inserts, then generate a random tree, then output a representation of the tree, and the number of leaves. use struct Node { int leavesInSubtree; Node *left, *right; Node() { leavesInSubtree=1; left = right = NULL; } };