diff --git "a/\346\225\260\346\215\256\347\273\223\346\236\204\347\257\207/\344\272\214\345\217\211\346\240\221.md" "b/\346\225\260\346\215\256\347\273\223\346\236\204\347\257\207/\344\272\214\345\217\211\346\240\221.md"
index 961f54b..a936f61 100644
--- "a/\346\225\260\346\215\256\347\273\223\346\236\204\347\257\207/\344\272\214\345\217\211\346\240\221.md"
+++ "b/\346\225\260\346\215\256\347\273\223\346\236\204\347\257\207/\344\272\214\345\217\211\346\240\221.md"
@@ -188,7 +188,7 @@ const dfsDownToUp = function(root){  //从下到上
 }
 
 const divideAndConquer = function(node){  //分治法
-    const res = [];
+    let res = [];
     if (node === null) {
         return null;
     }
@@ -502,4 +502,4 @@ var insertIntoBST = function (root, val) {
 -  [binary-tree-level-order-traversal-ii](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/)
 -  [binary-tree-zigzag-level-order-traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/)
 -  [validate-binary-search-tree](https://leetcode-cn.com/problems/validate-binary-search-tree/)
--  [insert-into-a-binary-search-tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/)
\ No newline at end of file
+-  [insert-into-a-binary-search-tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/)