三刷102

Author: diguage

docs/0102-binary-tree-level-order-traversal.adoc

@@ -36,21 +36,43 @@ return its level order traversal as:
 ]
 ----
 
+== 思路分析
+
+image:images/0102-00.png[]
 
 [[src-0102]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0102_BinaryTreeLevelOrderTraversal.java[tag=answer]
 ----
+--
 
+二刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0102_BinaryTreeLevelOrderTraversal_2.java[tag=answer]
 ----
+--
+
+三刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0102_BinaryTreeLevelOrderTraversal_3.java[tag=answer]
+----
+--
+====
 
 TIP: TODO：还可以优化成只用一个队列对象，思考如何实现？
 
-image:images/0102-00.png[]
 
 == 拓展题
 
@@ -59,4 +81,5 @@ image:images/0102-00.png[]
 == 参考资料
 
 . https://cloud.tencent.com/developer/article/1875052[LeetCode通关：连刷三十九道二叉树，刷疯了！^]
+. https://leetcode.cn/problems/binary-tree-level-order-traversal/solutions/2361604/102-er-cha-shu-de-ceng-xu-bian-li-yan-du-dyf7/?envType=study-plan-v2&envId=selected-coding-interview[102. 二叉树的层序遍历 - 广度优先遍历，清晰图解^]
 

logbook/202406.adoc

@@ -628,7 +628,12 @@
 |{counter:codes}
 |{leetcode_base_url}/first-bad-version/[278. First Bad Version^]
 |{doc_base_url}/0278-first-bad-version.adoc[题解]
-|
+|✅逼近边界的二分查找
+
+|{counter:codes}
+|{leetcode_base_url}/binary-tree-level-order-traversal/[102. Binary Tree Level Order Traversal^]
+|{doc_base_url}/0102-binary-tree-level-order-traversal.adoc[题解]
+|✅广度优先遍历
 
 |===
 

src/main/java/com/diguage/algo/leetcode/_0102_BinaryTreeLevelOrderTraversal_2.java

@@ -35,7 +35,7 @@
  * ----
  *
  * @author D瓜哥 · https://www.diguage.com
- * @since 2020-01-24 20:40
+ * @since 2024-06-25 11:27
  */
 public class _0102_BinaryTreeLevelOrderTraversal_2 {
   // tag::answer[]
@@ -44,6 +44,9 @@ public class _0102_BinaryTreeLevelOrderTraversal_2 {
    * Runtime: 3 ms, faster than 5.15% of Java online submissions for Binary Tree Level Order Traversal.
    * <p>
    * Memory Usage: 40.2 MB, less than 5.33% of Java online submissions for Binary Tree Level Order Traversal.
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-25 11:27
    */
   public List<List<Integer>> levelOrder(TreeNode root) {
     List<List<Integer>> result = new ArrayList<>();

src/main/java/com/diguage/algo/leetcode/_0102_BinaryTreeLevelOrderTraversal_3.java

@@ -0,0 +1,39 @@
+package com.diguage.algo.leetcode;
+
+import com.diguage.algo.util.TreeNode;
+
+import java.util.*;
+
+public class _0102_BinaryTreeLevelOrderTraversal_3 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-25 11:27
+   */
+  public List<List<Integer>> levelOrder(TreeNode root) {
+    if (root == null) {
+      return Collections.emptyList();
+    }
+    List<List<Integer>> result = new ArrayList<>();
+    Queue<TreeNode> queue = new LinkedList<>();
+    queue.offer(root);
+    while (!queue.isEmpty()) {
+      int size = queue.size();
+      List<Integer> nums = new ArrayList<>(size);
+      for (int i = 0; i < size; i++) {
+        TreeNode node = queue.poll();
+        nums.add(node.val);
+        if (node.left != null) {
+          queue.offer(node.left);
+        }
+        if (node.right != null) {
+          queue.offer(node.right);
+        }
+      }
+      result.add(nums);
+    }
+    return result;
+  }
+  // end::answer[]
+}