Updated markdown files

Author: Zanger67/leetcode

markdowns/Questions_By_Code_Length.md

@@ -63,6 +63,7 @@ Calculations are based on the code files's byte sizes.
 | 1087 | [Brace Expansion](<https://leetcode.com/problems/brace-expansion>)                                                                                                                         | Medium  |                | [solution](<_1087. Brace Expansion.md>)                                                             | py                                          | Jun 15, 2024    |
 |  606 | [Construct String from Binary Tree](<https://leetcode.com/problems/construct-string-from-binary-tree>)                                                                                     | Medium  |                | [solution](<_606. Construct String from Binary Tree.md>)                                            | java, py                                    | Aug 04, 2024    |
 | 2390 | [Removing Stars From a String](<https://leetcode.com/problems/removing-stars-from-a-string>)                                                                                               | Medium  |                | [solution](<_2390. Removing Stars From a String.md>)                                                | java, py                                    | Jun 02, 2024    |
+|  662 | [Maximum Width of Binary Tree](<https://leetcode.com/problems/maximum-width-of-binary-tree>)                                                                                               | Medium  |                | [solution](<_662. Maximum Width of Binary Tree.md>)                                                 | py                                          | Oct 28, 2024    |
 | 1230 | [Toss Strange Coins](<https://leetcode.com/problems/toss-strange-coins>)                                                                                                                   | Medium  | Weekly Premium | [solution](<_1230. Toss Strange Coins.md>)                                                          | c, java, py                                 | Jul 29, 2024    |
 |  951 | [Flip Equivalent Binary Trees](<https://leetcode.com/problems/flip-equivalent-binary-trees>)                                                                                               | Medium  | Daily          | [solution](<_951. Flip Equivalent Binary Trees.md>)                                                 | py                                          | Oct 24, 2024    |
 |  959 | [Regions Cut By Slashes](<https://leetcode.com/problems/regions-cut-by-slashes>)                                                                                                           | Medium  | Daily          | [solution](<_959. Regions Cut By Slashes.md>)                                                       | py                                          | Aug 10, 2024    |
@@ -174,7 +175,6 @@ Calculations are based on the code files's byte sizes.
 | 1255 | [Maximum Score Words Formed by Letters](<https://leetcode.com/problems/maximum-score-words-formed-by-letters>)                                                                             | Hard    |                | [solution](<_1255. Maximum Score Words Formed by Letters.md>)                                       | py                                          | Jun 15, 2024    |
 |  708 | [Insert into a Sorted Circular Linked List](<https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list>)                                                                     | Medium  |                | [solution](<_708. Insert into a Sorted Circular Linked List.md>)                                    | py                                          | Jun 22, 2024    |
 | 3211 | Weekly Contest 405 - q2 - [Generate Binary Strings Without Adjacent Zeros](<https://leetcode.com/problems/generate-binary-strings-without-adjacent-zeros>)                                 | Medium  | Contest        | [solution](<_3211. Generate Binary Strings Without Adjacent Zeros.md>)                              | js, py                                      | Jul 07, 2024    |
-|  662 | [Maximum Width of Binary Tree](<https://leetcode.com/problems/maximum-width-of-binary-tree>)                                                                                               | Medium  |                | [solution](<_662. Maximum Width of Binary Tree.md>)                                                 | py                                          | Oct 28, 2024    |
 |  107 | [Binary Tree Level Order Traversal II](<https://leetcode.com/problems/binary-tree-level-order-traversal-ii>)                                                                               | Medium  |                | [solution](<_107. Binary Tree Level Order Traversal II.md>)                                         | java                                        | Jul 04, 2024    |
 |  450 | [Delete Node in a BST](<https://leetcode.com/problems/delete-node-in-a-bst>)                                                                                                               | Medium  |                | [solution](<_450. Delete Node in a BST.md>)                                                         | py                                          | Jun 29, 2024    |
 | 1698 | [Number of Distinct Substrings in a String](<https://leetcode.com/problems/number-of-distinct-substrings-in-a-string>)                                                                     | Medium  |                | [solution](<_1698. Number of Distinct Substrings in a String.md>)                                   | java, py                                    | Jun 02, 2024    |

markdowns/_662. Maximum Width of Binary Tree.md

@@ -20,8 +20,45 @@
 
 ## Solutions
 
+- [m662 bfs.py](<../my-submissions/m662 bfs.py>)
 - [m662 dfs.py](<../my-submissions/m662 dfs.py>)
 ### Python
+#### [m662 bfs.py](<../my-submissions/m662 bfs.py>)
+```Python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def widthOfBinaryTree(self, root: Optional[TreeNode]) -> int:
+        nxt_nodes = deque([(root, 0, 0)])      # node, index, depth
+
+        max_width = 0
+        leftmost, rightmost = inf, -inf
+        curr_depth = None
+        while nxt_nodes :
+            curr, indx, depth = nxt_nodes.popleft()
+            if curr_depth != depth :
+                max_width = max(max_width, rightmost - leftmost + 1)
+                leftmost, rightmost, curr_depth = inf, -inf, depth
+
+            if leftmost > indx :
+                leftmost = indx
+            if rightmost < indx :
+                rightmost = indx
+
+            if curr.left :
+                nxt_nodes.append((curr.left, 2 * indx, depth + 1))
+            if curr.right :
+                nxt_nodes.append((curr.right, 2 * indx + 1, depth + 1))
+
+        max_width = max(max_width, rightmost - leftmost + 1)
+        return max_width
+
+```
+
 #### [m662 dfs.py](<../my-submissions/m662 dfs.py>)
 ```Python
 # Definition for a binary tree node.