binary.trees/binary.tree.c
void makeQueue(Node* root, int parent) {
    if (root) {
        nodesCount++;
        nodesQueue[parent] = root;
        makeQueue(root->leftChild, (parent * 2) + 1);
        makeQueue(root->rightChild, (parent * 2) + 2);
    }
}
/**
 * makeQueue: build the queue of nodes for level order displaying
 * @param root the root of the tree
 * @param parent where to start building the queue (0 for root)
*/
build the queue of nodes for level order displaying
@param root the root of the tree
@param parent where to start building the queue (0 for root)
build the queue of nodes for level order displaying @param root the root of the tree @param parent where to start building the queue ( 0 for root )
void makeQueue(Node* root, int parent) {
    if (root) {
        nodesCount++;
        nodesQueue[parent] = root;
        makeQueue(root->leftChild, (parent * 2) + 1);
        makeQueue(root->rightChild, (parent * 2) + 2);
    }
}
void makeQueue ( Node * root , int parent ) { if ( root ) { nodesCount ++ ; nodesQueue [ parent ] = root ; makeQueue ( root -> leftChild , ( parent * 2 ) + 1 ) ; makeQueue ( root -> rightChild , ( parent * 2 ) + 2 ) ; } }
makeQueue: build the queue of nodes for level order displaying
 @param root the root of the tree
 @param parent where to start building the queue (0 for root)
makeQueue : build the queue of nodes for level order displaying @param root the root of the tree @param parent where to start building the queue ( 0 for root )