Diagonal Traversal of Binary Tree

C++ Questions/Diagonal_Traversal_of_BinaryTree

@@ -0,0 +1,89 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// Tree node
+struct Node
+{
+    int data;
+    Node *left, *right;
+};
+
+/* root - root of the binary tree
+   d -  distance of current line from rightmost
+        -topmost slope.
+   diagonalPrint - multimap to store Diagonal
+                   elements (Passed by Reference) */
+void diagonalPrintUtil(Node* root, int d,
+                      map<int, vector<int>> &diagonalPrint)
+{
+    // Base case
+    if (!root)
+        return;
+
+    // Store all nodes of same line together as a vector
+    diagonalPrint[d].push_back(root->data);
+
+    // Increase the vertical distance if left child
+    diagonalPrintUtil(root->left, d + 1, diagonalPrint);
+
+    // Vertical distance remains same for right child
+    diagonalPrintUtil(root->right, d, diagonalPrint);
+}
+
+// Print diagonal traversal of given binary tree
+void diagonalPrint(Node* root)
+{
+    // create a map of vectors to store Diagonal elements
+    map<int, vector<int> > diagonalPrint;
+    diagonalPrintUtil(root, 0, diagonalPrint);
+
+    cout << "Diagonal Traversal of binary tree : n";
+    for (auto it = diagonalPrint.begin();
+         it != diagonalPrint.end(); ++it)
+    {
+        for (auto itr = it->second.begin();
+             itr != it->second.end(); ++itr)
+            cout << *itr  << ' ';
+
+        cout << 'n';
+    }
+}
+
+// Utility method to create a new node
+Node* newNode(int data)
+{
+    Node* node = new Node;
+    node->data = data;
+    node->left = node->right = NULL;
+    return node;
+}
+
+// Driver program
+int main()
+{
+    Node* root = newNode(8);
+    root->left = newNode(3);
+    root->right = newNode(10);
+    root->left->left = newNode(1);
+    root->left->right = newNode(6);
+    root->right->right = newNode(14);
+    root->right->right->left = newNode(13);
+    root->left->right->left = newNode(4);
+    root->left->right->right = newNode(7);
+
+    /*  Node* root = newNode(1);
+        root->left = newNode(2);
+        root->right = newNode(3);
+        root->left->left = newNode(9);
+        root->left->right = newNode(6);
+        root->right->left = newNode(4);
+        root->right->right = newNode(5);
+        root->right->left->right = newNode(7);
+        root->right->left->left = newNode(12);
+        root->left->right->left = newNode(11);
+        root->left->left->right = newNode(10);*/
+
+    diagonalPrint(root);
+
+    return 0;
+}