Time: 17 ms (46.16%), Space: 17.4 MB (58.81%) - LeetHub

sainikcodes24x7 · Oct 2, 2022 · 49860fb · 49860fb
1 parent 04b6991
commit 49860fb
Showing 1 changed file with 39 additions and 0 deletions.
diff --git a/662-maximum-width-of-binary-tree/662-maximum-width-of-binary-tree.cpp b/662-maximum-width-of-binary-tree/662-maximum-width-of-binary-tree.cpp
@@ -0,0 +1,39 @@
+/**
+ * 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:
+    int widthOfBinaryTree(TreeNode* root) {
+        if(!root)
+            return 0;
+        int res=1;
+        queue<pair<TreeNode*,int>>q;
+        q.push({root,0});
+        while(!q.empty())
+        {
+            int n=q.size();
+            int left=q.front().second;
+            int right=q.back().second;
+            res=max(res,right-left+1);
+            for(int i=0;i<n;i++)
+            {
+                pair<TreeNode*,int>top=q.front();
+                q.pop();
+                int idx=top.second-left;
+                if(top.first->left)
+                    q.push({top.first->left,(long long)2*idx+1});
+                if(top.first->right)
+                    q.push({top.first->right,(long long)2*idx+2});
+            }
+        }
+        return res;
+    }
+};