binary.trees/binary.tree.c
void printTree(Node* root, int space) {
    if (!root) 
        return; 
  
    space += 5; 
  
    printTree(root->rightChild, space); 
    printf("\n"); 

    for (int i = 5; i < space; i++) 
        printf(" "); 

    printf("%d\n", root->data); 
  
    printTree(root->leftChild, space); 
}
/**
 * printTree: displays the tree in 2D, easy to understand 
 * @param root the root of the tree
 * @param space how much space from the left of the terminal
 * @return void
*/
displays the tree in 2D, easy to understand
@param root the root of the tree
@param space how much space from the left of the terminal
@return void
displays the tree in 2D easy to understand @param root the root of the tree @param space how much space from the left of the terminal @return void
void printTree(Node* root, int space) {
    if (!root) 
        return; 
    space += 5; 
    printTree(root->rightChild, space); 
    printf("\n"); 
    for (int i = 5; i < space; i++) 
        printf(" "); 
    printf("%d\n", root->data); 
    printTree(root->leftChild, space); 
}
void printTree ( Node * root , int space ) { if ( ! root ) return ; space += 5 ; printTree ( root -> rightChild , space ) ; printf ( " \n " ) ; for ( int i = 5 ; i < space ; i ++ ) printf ( " " ) ; printf ( " \n " , root -> data ) ; printTree ( root -> leftChild , space ) ; }
printTree: displays the tree in 2D, easy to understand
 @param root the root of the tree
 @param space how much space from the left of the terminal
 @return void
printTree : displays the tree in 2D easy to understand @param root the root of the tree @param space how much space from the left of the terminal @return void