14. Tree/all_traversal_of_tree_using_recursion_and_iteration.cpp
void rprintInorder(struct Node *node)
{
    if (node == NULL)
        return;

    /* first recur on left child */
    rprintInorder(node->left);

    /* then print the data of node */
    cout << node->data << " ";

    /* now recur on right child */
    rprintInorder(node->right);
}
/* Given a binary tree, print its nodes in inorder*/
Given a binary tree, print its nodes in inorder
Given a binary tree print its nodes in inorder
void rprintInorder(struct Node *node)
{
    if (node == NULL)
        return;
    rprintInorder(node->left);
    cout << node->data << " ";
    rprintInorder(node->right);
}
void rprintInorder ( struct Node * node ) { if ( node == NULL ) return ; rprintInorder ( node -> left ) ; cout << node -> data << " " ; rprintInorder ( node -> right ) ; }
Given a binary tree, print its nodes in inorder
Given a binary tree print its nodes in inorder
/* first recur on left child */ /* then print the data of node */ /* now recur on right child */