Create Vertical order traversal in a binary tree.cpp

[devanshikapla]

/**

• Definition for a binary tree node.

• struct TreeNode {

• int val;
  

• TreeNode *left;
  

• TreeNode *right;
  

• TreeNode() : val(0), left(nullptr), right(nullptr) {}
  

• TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
  

• TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
  

• }; */ class Solution { public: vector < vector < int >> verticalTraversal(TreeNode * root) { map < int, map < int, multiset < int >>> nodes; queue < pair < TreeNode * , pair < int, int >>> todo; todo.push({ root, { 0, 0 } }); //initial vertical and level while (!todo.empty()) { auto p = todo.front(); todo.pop(); TreeNode * temp = p.first;

  //x -> vertical , y->level int x = p.second.first, y = p.second.second; nodes[x][y].insert(temp -> val); //inserting to multiset

  if (temp -> left) { todo.push({ temp -> left, { x - 1, y + 1 } }); } if (temp -> right) { todo.push({ temp -> right, { x + 1, y + 1 } }); } } vector < vector < int >> ans; for (auto p: nodes) { vector < int > col; for (auto q: p.second) { col.insert(col.end(), q.second.begin(), q.second.end()); } ans.push_back(col); } return ans; } };

[markandey007]

Please Star ⭐️ the repo to earn "hacktober-accepted" label for the event.