|
| 1 | +#include<bits/stdc++.h> |
| 2 | +usingnamespacestd; |
| 3 | + |
| 4 | +classnode{ |
| 5 | +public: |
| 6 | +int data; |
| 7 | + node* left; |
| 8 | + node* right; |
| 9 | +node(int data){ |
| 10 | +this->data = data; |
| 11 | +this->left =NULL; |
| 12 | +this->right =NULL; |
| 13 | + } |
| 14 | +}; |
| 15 | + |
| 16 | +node *buildTreeUsingLevelOrderTraversal(vector<int> vec){ |
| 17 | + queue<node*> q; |
| 18 | + node *root =newnode(vec[0]); |
| 19 | + q.push(root); |
| 20 | +for(int i =1; i < vec.size(); i+=2) |
| 21 | + { |
| 22 | + node* temp = q.front(); |
| 23 | + q.pop(); |
| 24 | +if(vec[i] != -1){ |
| 25 | + node *l =newnode(vec[i]); |
| 26 | + q.push(l); |
| 27 | + temp->left = l; |
| 28 | + } |
| 29 | +if(vec[i+1] != -1){ |
| 30 | + node *r =newnode(vec[i+1]); |
| 31 | + q.push(r); |
| 32 | + temp->right = r; |
| 33 | + } |
| 34 | + } |
| 35 | + |
| 36 | +return root; |
| 37 | +} |
| 38 | + |
| 39 | +voidlevelOrderTraversal(node *root){ |
| 40 | + queue<node*> q; |
| 41 | + q.push(root); |
| 42 | + q.push(NULL); |
| 43 | +while(!q.empty()){ |
| 44 | + node *temp = q.front(); |
| 45 | +if(temp ==NULL){ |
| 46 | + cout << endl; |
| 47 | + q.pop(); |
| 48 | +if(!q.empty()) |
| 49 | + q.push(NULL); |
| 50 | + } |
| 51 | +else{ |
| 52 | + q.pop(); |
| 53 | +if(temp->left) |
| 54 | + q.push(temp->left); |
| 55 | +if(temp->right) |
| 56 | + q.push(temp->right); |
| 57 | + cout << temp->data <<""; |
| 58 | + } |
| 59 | + } |
| 60 | +} |
| 61 | + |
| 62 | +voidprintAtLevelK(node* root,int k){ |
| 63 | +if(root ==NULL) |
| 64 | +return; |
| 65 | +if (k ==0){ |
| 66 | + cout << root->data <<""; |
| 67 | +return; |
| 68 | + } |
| 69 | +printAtLevelK(root->left, k -1); |
| 70 | +printAtLevelK(root->right, k -1); |
| 71 | + |
| 72 | +return; |
| 73 | +} |
| 74 | + |
| 75 | +voidtraverseTree(node* root,int d, map<int, vector<int>> &m){ |
| 76 | +if(root ==NULL) |
| 77 | +return; |
| 78 | + m[d].push_back(root->data); |
| 79 | +traverseTree(root->left, d -1, m); |
| 80 | +traverseTree(root->right, d +1, m); |
| 81 | + |
| 82 | +return; |
| 83 | + |
| 84 | +} |
| 85 | + |
| 86 | +voidverticalPrint(node *root){ |
| 87 | + map<int, vector<int>> m; |
| 88 | +int d =0; |
| 89 | + |
| 90 | +traverseTree(root, d, m); |
| 91 | +for(auto p: m){ |
| 92 | +int key = p.first; |
| 93 | + vector<int> line = p.second; |
| 94 | +for(auto data: line) |
| 95 | + cout << data <<""; |
| 96 | + cout << endl; |
| 97 | + } |
| 98 | +} |
| 99 | + |
| 100 | + |
| 101 | +intmain() { |
| 102 | + node* root =newnode(1); |
| 103 | +root->left =newnode(2); |
| 104 | +root->right =newnode(3); |
| 105 | +root->left->left =newnode(4); |
| 106 | +root->left->right =newnode(5); |
| 107 | +root->right->left =newnode(6); |
| 108 | +root->right->right =newnode(7); |
| 109 | +root->right->left->right =newnode(8); |
| 110 | +root->right->right->right =newnode(9); |
| 111 | + |
| 112 | +verticalPrint(root); |
| 113 | +} |