Diagonal Traversal of Binary Tree.cpp

/*
Diagonal Traversal of Binary Tree
=================================

Given a Binary Tree, print the diagonal traversal of the binary tree.

Consider lines of slope -1 passing between nodes. Given a Binary Tree, print all diagonal elements in a binary tree belonging to same line.

Example 1:
Input :
            8
         /     \
        3      10
      /   \      \
     1     6     14
         /   \   /
        4     7 13
Output : 8 10 14 3 6 7 13 1 4
Explanation:
unnamed
Diagonal Traversal of binary tree : 
 8 10 14 3 6 7 13 1 4

Your Task:
You don't need to read input or print anything. The task is to complete the function diagonal() that takes the root node as input argumets and returns the diagonal traversal of the given tree.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(N).
Here N is number of nodes.

Constraints:
1 <= Number of nodes<= 105
1 <= Data of a node<= 105
*/

map<int, vector<int>> M;
void dfs(Node *root, int point)
{
  if (!root)
    return;
  M[point].push_back(root->data);
  dfs(root->left, point + 1);
  dfs(root->right, point);
}

vector<int> diagonal(Node *root)
{
  M.clear();
  dfs(root, 0);
  vector<int> ans;
  for (auto &i : M)
  {
    for (auto &j : i.second)
      ans.push_back(j);
  }
  return ans;
}