How to print the top view of an binary Tree?

Question

Answer 1

The idea is to trace all the left element starting from root node and then print it in the bottom up manner using the function printLeft, and then print right element starting from root node in top down manner, to avoid printing of root node twice I have used flag. Here is the function:

void printLeft(node *p){
    if(p){
        printLeft(p->left);
        cout<< p->data << ' ';
    }
}
void printRight(node *p){
    static int flag=1;
    if(p){
        if(flag!=1)
          cout<< p->data << ' ';
        flag++;
        printRight(p->right);

    }
}
void top_view(node * root)
{
  printLeft(root);
  printRight(root);
}