Merge pull request #1772 from 17Moons/17Moons-contribution

17 moons contribution

Program's_Contributed_By_Contributors/C++/vertical-traversal-binary-tree.cpp

@@ -0,0 +1,33 @@
+void vTraversal(Node *root) 
+{ 
+	map<int, vector<int>> mp; 
+	queue<pair<Node *, int>>q; 
+	q,push({root,0}); 
+	while(q.empty()==false) 
+	{ 
+		auto p = q.front(); 
+		Node *curr = p.first; 
+		int hd = p.second; 
+		mp[hd].push_back(curr->data); 
+		q.pop(); 
+		if(curr->left != NULL) 
+		{ 
+			q.push({curr->left, hd-1}); 
+		} 
+		if(curr->right != NULL) 
+		{ 
+			q.push({curr->right, hd+1}); 
+		} 
+	}
+
+
+for(auto p: mp) 
+{ 
+	vector <int> v =p.second; 
+	for(int x: v) 
+	{ 
+		cout<<c<<" "; 
+		cout<<endl; 
+	} 
+}
+}