Tree/Binary Search Tree/BST Inorder traversal.cpp
// BST In-order Traversal using Recursion
BST In-order Traversal using Recursion
BST In - order Traversal using Recursion
void inorderTraversal(struct node *root)
{
    if (root != NULL)
    {
        inorderTraversal(root->left);
        printf("%d-> ", root->data);
        inorderTraversal(root->right);
    }
}
void inorderTraversal ( struct node * root ) { if ( root != NULL ) { inorderTraversal ( root -> left ) ; printf ( " " , root -> data ) ; inorderTraversal ( root -> right ) ; } }
BST In-order Traversal using Recursion
BST In - order Traversal using Recursion