binary.trees/binary.tree.c
void inorder(Node* root) {
    if (root) {
        inorder(root->leftChild);
        printf("%3d", root->data);
        inorder(root->rightChild);
    }
}
/**
 * inorder: prints the tree with the inorder method (see explaination)
 * @param root the root of the tree
*/
prints the tree with the inorder method
@param root the root of the tree
prints the tree with the inorder method @param root the root of the tree
void inorder(Node* root) {
    if (root) {
        inorder(root->leftChild);
        printf("%3d", root->data);
        inorder(root->rightChild);
    }
}
void inorder ( Node * root ) { if ( root ) { inorder ( root -> leftChild ) ; printf ( " " , root -> data ) ; inorder ( root -> rightChild ) ; } }
inorder: prints the tree with the inorder method (see explaination)
 @param root the root of the tree
inorder : prints the tree with the inorder method ( see explaination ) @param root the root of the tree