Bottom view of the Binary tree.cpp

#include<bits/stdc++.h> 
using namespace std; 
struct Node 
{ 
    int data; 
    int hd;
    Node *left, *right; 

    Node(int key) 
    { 
        data = key; 
        hd = INT_MAX; 
        left = right = NULL; 
    } 
}; 
void bottomView(Node *root) 
{ 
    if (root == NULL) 
        return; 
    int hd = 0; 
    map<int, int> m; 
    queue<Node *> q; 
    root->hd = hd; 
    q.push(root);
    while (!q.empty()) 
    { 
        Node *temp = q.front(); 
        q.pop(); 
         hd = temp->hd;
         m[hd] = temp->data;
         if (temp->left != NULL) 
        { 
            temp->left->hd = hd-1; 
            q.push(temp->left); 
        } 
        if (temp->right != NULL) 
        { 
            temp->right->hd = hd+1; 
            q.push(temp->right); 
        } 
    } 
    for (auto i = m.begin(); i != m.end(); ++i) 
        cout << i->second << " "; 
} 
int main() 
{ 
    Node *root = new Node(20); 
    root->left = new Node(8); 
    root->right = new Node(22); 
    root->left->left = new Node(5); 
    root->left->right = new Node(3); 
    root->right->left = new Node(4); 
    root->right->right = new Node(25); 
    root->left->right->left = new Node(10); 
    root->left->right->right = new Node(14); 
    cout << "Bottom view of the given binary tree :\n"
    bottomView(root); 
    return 0; 
} 

//Input Format:
//Enter the value of the nodes of the binary tree.

//Output Format:
//Bottom view of the binary tree.

//Sample Input Format:
//                    20
//                    /    \
//                  8       22
//                /   \    /   \
//              5      3 4     25
//                    / \      
//                  10    14 

//Sample Output Format:
//5, 10, 4, 14, 25.