Print all Root to Leaf Paths in a Binary Tree

/* C++ Program to Print All Root to Leaf Path in a Binary Tree */
#include<bits/stdc++.h>
using namespace std;

typedef struct Node
{
    int data;
    struct Node *left;
    struct Node *right;
    Node(int ele)
    {
        data = ele;
        left = NULL;
        right = NULL;
    }
} Node;

/* Function to Print All Root to Leaf Path in a Binary Tree */
void printPaths(Node *root, vector<int> &vc)
{
    /* Base Condition: Empty Tree */
    if(root == NULL)
    return;
    
    /* Push Node in current Path Vector */
    vc.push_back(root -> data);
    
    /* If current Node is Leaf Node, we'll print the Path */
    if(root -> left == NULL && root -> right == NULL)
    {
        for(int i = 0; i < vc.size(); i++)
        cout<<vc[i]<<" ";
        
        cout<<endl;
    }
    
    /* Recur for Left and Right Subtree */
    printPaths(root -> left, vc);
    printPaths(root -> right, vc);
    
    /* Pop Out Current Node after left and right subtree are done */
    vc.pop_back();
}

/* Function to Print All Root to Leaf Path in a Binary Tree */
void printRootToLeaf(Node *root)
{
    /* Base Condition: Empty Tree */
    if(root == NULL)
    return;
    
    vector<int> vc;
    printPaths(root,vc);
}

int main()
{
    /* Creating a Binary trees and inserting some nodes in it */
    Node *root = NULL;
    
    root = new Node(1);
    root -> left = new Node(2);
    root -> right = new Node(3);
    root -> left -> left = new Node(4);
    root -> left -> right = new Node(5);
    root -> right -> left = new Node(6);
    root -> right -> right = new Node (7);
    root -> left -> right -> left = new Node(8);
    root -> right -> left -> right = new Node(9);
    
    /* Calling function to Print All Root to Leaf Path in a Binary Tree */
    printRootToLeaf(root);
}