aboutsummaryrefslogtreecommitdiff
path: root/vertical_order_bst.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'vertical_order_bst.cpp')
-rw-r--r--vertical_order_bst.cpp29
1 files changed, 0 insertions, 29 deletions
diff --git a/vertical_order_bst.cpp b/vertical_order_bst.cpp
deleted file mode 100644
index a429d4d..0000000
--- a/vertical_order_bst.cpp
+++ /dev/null
@@ -1,29 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- vvd verticalTraversal(TreeNode *root) {
- map<int, map<int, multiset<int>>> mmm;
- queue<pair<TreeNode *, pair<int, int>>> qpp;
- qpp.push({root, {0, 0}});
- while (!qpp.empty()) {
- auto p = qpp.front();
- qpp.pop();
- TreeNode *node = p.first;
- int x = p.second.first, y = p.second.second;
- mmm[x][y].insert(node->val);
- if (node->left)
- qpp.push({node->left, {x - 1, y + 1}});
- if (node->right)
- qpp.push({node->right, {x + 1, y + 1}});
- }
- vvd ans;
- for (auto q : mmm) {
- vector<int> col;
- for (auto p : q.second)
- col.insert(col.end(), p.second.begin(), p.second.end());
- ans.push_back(col);
- }
- return ans;
- }
-};