build

docs/chapter_tree/array_representation_of_tree.md

@@ -1020,18 +1020,11 @@ comments: true
 
         /* 层序遍历 */
         fn level_order(&self) -> Vec<i32> {
-            let mut res = vec![];
-            // 直接遍历数组
-            for i in 0..self.size() {
-                if let Some(val) = self.val(i) {
-                    res.push(val)
-                }
-            }
-            res
+            self.tree.iter().filter_map(|&x| x).collect()
         }
 
         /* 深度优先遍历 */
-        fn dfs(&self, i: i32, order: &str, res: &mut Vec<i32>) {
+        fn dfs(&self, i: i32, order: &'static str, res: &mut Vec<i32>) {
             if self.val(i).is_none() {
                 return;
             }