BinaryTree/bottom_View_Of_The_Tree_Recursively.cpp at master · arpansahu/BinaryTree · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
#include <stdio.h>
#include <malloc.h>
/* nodes for queue and tree node*/
struct node {
    int key;
    struct node * left;
    struct node * right;
};

/* function for creating new node of tree*/
struct node *newNode(int data)
{
    struct node *node = (struct node *)malloc(sizeof(struct node));
    node->key = data;
    node->left = NULL;
    node->right = NULL;
    return (node);
}


/*building a map for storing a pair and key */
struct  pairinc{
    int first ;
    int second;
};
struct pairinc * newPair(int first,int second){
    struct pairinc *  temp = (struct pairinc * ) malloc(sizeof(struct pairinc));
    temp->first = first;
    temp->second = second;
}
struct  mapinc{
    int key ;
    struct pairinc * point;
    struct mapinc * next;
};
struct mapinc * mapper = NULL;
void insertInMap(struct pairinc * pair,int key){
    struct mapinc *  temp = (struct mapinc *) malloc(sizeof(struct mapinc));
    temp->key =  key;
    temp->point = pair;
    temp->next = NULL;
    int condition = 1;
    if(mapper == NULL){
        mapper = temp;
    } else{
        struct mapinc *  iter =  mapper;
        while(iter != NULL && condition){

            if(iter->key == temp->key){
                iter->point = temp->point;
                condition = 0;
                return ;
            }
            iter = iter->next;

        }
        if(condition == 1){
            temp->next = mapper;
            mapper = temp;
        }
    }
}
int sizeofmap(){
    int size= 0;
    struct mapinc *  iter =  mapper;
    while(iter != NULL){
        size++;
        iter = iter->next;
    }
    return size;
}
void sortmapinc(){
    struct mapinc *  iter1 =  mapper;

    while (iter1 != NULL){
        struct mapinc *  iter2 =  iter1->next;
        while(iter2 != NULL){

            if(iter1->key > iter2->key){
                struct pairinc *temppair = iter1->point;
                iter1->point = iter2->point;
                iter2->point = temppair;
                int tempkey = iter1->key;
                iter1->key = iter2->key;
                iter2->key = tempkey;
            }
            iter2 = iter2->next;
        }iter1 = iter1->next;
    }
}
void viewmap(){
    sortmapinc();
    struct mapinc *  iter =  mapper;
    if(iter == NULL){
        return;
    }

    while(iter != NULL){
        printf("key :%d  and pair is (%d , %d) \n",iter->key,iter->point->first,iter->point->second);
        iter = iter->next;
    }

}


/*function for level order traversal iteratively*/
void bottomViewOfTheTreeRecursively(node *root,int distance, int level)
{
    if (root == nullptr)
        return;
    struct pairinc * pair1 = newPair(root->key,level);
    insertInMap(pair1,distance);
    bottomViewOfTheTreeRecursively(root->left, distance - 1, level + 1);
    bottomViewOfTheTreeRecursively(root->right, distance + 1, level + 1);
}
void printbottomViewOfTheTreeRecursively(node * root){
    bottomViewOfTheTreeRecursively(root, 0, 0);
    sortmapinc();
    struct mapinc *  iter =  mapper;
    while(iter != NULL){
        printf("%d ",iter->point->first);
        iter = iter->next;
    }

}

int main(){


    struct node *root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(3);
    root->left->right = newNode(4);
    root->right->left = newNode(5);
    root->right->right = newNode(6);
    root->right->left->left = newNode(7);
    root->right->left->right = newNode(8);
    printbottomViewOfTheTreeRecursively(root);

    return 0;
}