binary.trees/binary.tree.c
void createFullTree(Node* root, int levels) {
    if (root) {
        if (levels > 0) {
            root->leftChild = createNode((rand() % 100) + 1);
            root->rightChild = createNode((rand() % 100) + 1);
            createFullTree(root->leftChild, --levels);
            createFullTree(root->rightChild, levels--);
        } else {
            return;
        }
    }
}
/**
 * createFullTree: recursively generate a FULL binary tree given a number of levels
 * @param root a pointer to the root of the node
 * @param levels number of levels of the tree
 * @return void
*/
recursively generate a FULL binary tree given a number of levels
@param root a pointer to the root of the node
@param levels number of levels of the tree
@return void
recursively generate a FULL binary tree given a number of levels @param root a pointer to the root of the node @param levels number of levels of the tree @return void
void createFullTree(Node* root, int levels) {
    if (root) {
        if (levels > 0) {
            root->leftChild = createNode((rand() % 100) + 1);
            root->rightChild = createNode((rand() % 100) + 1);
            createFullTree(root->leftChild, --levels);
            createFullTree(root->rightChild, levels--);
        } else {
            return;
        }
    }
}
void createFullTree ( Node * root , int levels ) { if ( root ) { if ( levels > 0 ) { root -> leftChild = createNode ( ( rand ( ) % 100 ) + 1 ) ; root -> rightChild = createNode ( ( rand ( ) % 100 ) + 1 ) ; createFullTree ( root -> leftChild , -- levels ) ; createFullTree ( root -> rightChild , levels -- ) ; } else { return ; } } }
createFullTree: recursively generate a FULL binary tree given a number of levels
 @param root a pointer to the root of the node
 @param levels number of levels of the tree
 @return void
createFullTree : recursively generate a FULL binary tree given a number of levels @param root a pointer to the root of the node @param levels number of levels of the tree @return void