Content-Length: 2653 | pFad | http://github.com/fishercoder1534/Leetcode/pull/123.patch

thub.com From 9a4169d0d1981c11f851d255d7248293ae64f222 Mon Sep 17 00:00:00 2001 From: divyalakhwani31 <34311805+divyalakhwani31@users.noreply.github.com> Date: Wed, 28 Oct 2020 18:38:37 +0530 Subject: [PATCH] Create 1609. Even Odd Tree --- cpp/1609. Even Odd Tree | 61 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 cpp/1609. Even Odd Tree diff --git a/cpp/1609. Even Odd Tree b/cpp/1609. Even Odd Tree new file mode 100644 index 0000000000..f80dbc805d --- /dev/null +++ b/cpp/1609. Even Odd Tree @@ -0,0 +1,61 @@ +/** + * 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: + bool isEvenOddTree(TreeNode* root) { + vector> v; + queue> q; + q.push({root, 0}); + + while(!q.empty()) { + int sz = q.size(); + vector tmp; + for(int i = 0; i < sz; ++i) { + pair p = q.front(); + q.pop(); + int val = p.first->val, l = p.second; + tmp.push_back(val); + + if(p.first->left) q.push({p.first->left, l+1}); + if(p.first->right) q.push({p.first->right, l+1}); + } + + v.push_back(tmp); + } + + for(int i = 0; i < v.size(); ++i) { + if(i%2 == 0) { + if(v[i].size() > 0) { + vector tmp = v[i]; + sort(tmp.begin(), tmp.end()); + if(v[i] != tmp) return false; + for(int i = 0; i < tmp.size(); ++i) { + if(i > 0 and tmp[i-1] == tmp[i]) return false; + if(tmp[i]%2 == 0) return false; + } + } + } else { + if(v[i].size() > 0) { + vector tmp = v[i]; + sort(tmp.rbegin(), tmp.rend()); + if(v[i] != tmp) return false; + for(int i = 0; i < tmp.size(); ++i) { + if(i > 0 and tmp[i-1] == tmp[i]) return false; + if(tmp[i]%2 != 0) return false; + } + } + } + } + + return true; + } +};

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier! Saves Data!