修正代码格式

Author: diguage

docs/0000-01-sliding-window.adoc

@@ -68,8 +68,8 @@ LeetCode 1074. Number of Submatrices That Sum to Target (hard)
 int left = 0, right = 0;
 
 while (right < s.size()) {
-window.add(s[right]);
-right++;
+    window.add(s[right]);
+    right++;
 
     while (valid) {
         window.remove(s[left]);
@@ -93,4 +93,4 @@ right++;
 
 . https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/solution/hua-dong-chuang-kou-tong-yong-si-xiang-jie-jue-zi-/[滑动窗口通用思想解决子串问题 - 找到字符串中所有字母异位词 - 力扣（LeetCode）]
 . https://leetcode-cn.com/problems/find-all-anagrams-in-a-string/solution/javayou-hua-labuladongda-lao-hua-dong-chuang-kou-t/[Java优化labuladong大佬滑动窗口通用方法 - 找到字符串中所有字母异位词 - 力扣（LeetCode）]
-. https://mp.weixin.qq.com/s/6YeZUCYj5ft-OGa85sQegw[面试官，你再问我滑动窗口问题试试？我有解题模板，不怕！]
+. https://mp.weixin.qq.com/s/6YeZUCYj5ft-OGa85sQegw[面试官，你再问我滑动窗口问题试试？我有解题模板，不怕！]

src/main/java/com/diguage/algorithm/util/TreeNodeUtils.java

@@ -3,10 +3,7 @@
 import com.fasterxml.jackson.core.JsonProcessingException;
 import com.fasterxml.jackson.databind.ObjectMapper;
 
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.List;
-import java.util.Objects;
+import java.util.*;
 
 /**
  * @author D瓜哥, https://www.diguage.com/
@@ -41,6 +38,24 @@ public static TreeNode buildTree(List<Integer> array) {
         return result;
     }
 
+    public List<Integer> printTree(TreeNode root) {
+      if (Objects.isNull(root)) {
+        return Collections.emptyList();
+      }
+      List<Integer> result = new ArrayList<>();
+      Deque<TreeNode> stack = new LinkedList<>();
+      stack.offer(root);
+      int level = 1;
+      while (!stack.isEmpty()) {
+        int size = stack.size();
+        for (int i = 0; i < size; i++) {
+          TreeNode node = stack.poll();
+        }
+      }
+
+      return result;
+    }
+
     public static void main(String[] args) throws JsonProcessingException {
         ObjectMapper mapper = new ObjectMapper();
         List<Integer> integers = Arrays.asList(1, 2, 2, 3, 4, 4, 3);