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

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

    /* then recur on left sutree */
    rprintPreorder(node->left);

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