binary.trees/binary.tree.c
Node* createNode(int val) {
    Node *temp = malloc(sizeof(Node));
    temp->data = val;
    temp->leftChild = NULL;
    temp->rightChild = NULL;

    return temp;
}
/**
 * createNode: creates a node
 * @param val the numeric value of the node
 * @return a pointer to that newly created node
*/
creates a node
@param val the numeric value of the node
@return a pointer to that newly created node
creates a node @param val the numeric value of the node @return a pointer to that newly created node
Node* createNode(int val) {
    Node *temp = malloc(sizeof(Node));
    temp->data = val;
    temp->leftChild = NULL;
    temp->rightChild = NULL;
    return temp;
}
Node * createNode ( int val ) { Node * temp = malloc ( sizeof ( Node ) ) ; temp -> data = val ; temp -> leftChild = NULL ; temp -> rightChild = NULL ; return temp ; }
createNode: creates a node
 @param val the numeric value of the node
 @return a pointer to that newly created node
createNode : creates a node @param val the numeric value of the node @return a pointer to that newly created node