feat(chapter_backtracking): Add js and ts codes for chapter 13.3 (#667)

* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1

* style(chapter_dynamic_programming): format code

* refactor(chapter_dynamic_programming): remove main definition and add type

* feat(chapter_backtracking): Add js and ts codes for chapter 13.3

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.2

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.3

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.4

* style(chapter_divide_and_conquer): fix typo

* refactor: Use === instead of == in js and ts

codes/javascript/chapter_divide_and_conquer/build_tree.js

@@ -0,0 +1,44 @@
+/**
+ * File: build_tree.js
+ * Created Time: 2023-07-30
+ * Author: yuan0221 (yl1452491917@gmail.com)
+ */
+
+const { printTree } = require('../modules/PrintUtil');
+const { TreeNode } = require('../modules/TreeNode');
+
+/* 构建二叉树：分治 */
+function dfs(preorder, inorder, hmap, i, l, r) {
+    // 子树区间为空时终止
+    if (r - l < 0) return null;
+    // 初始化根节点
+    const root = new TreeNode(preorder[i]);
+    // 查询 m ，从而划分左右子树
+    const m = hmap.get(preorder[i]);
+    // 子问题：构建左子树
+    root.left = dfs(preorder, inorder, hmap, i + 1, l, m - 1);
+    // 子问题：构建右子树
+    root.right = dfs(preorder, inorder, hmap, i + 1 + m - l, m + 1, r);
+    // 返回根节点
+    return root;
+}
+
+/* 构建二叉树 */
+function buildTree(preorder, inorder) {
+    // 初始化哈希表，存储 inorder 元素到索引的映射
+    let hmap = new Map();
+    for (let i = 0; i < inorder.length; i++) {
+        hmap.set(inorder[i], i);
+    }
+    const root = dfs(preorder, inorder, hmap, 0, 0, inorder.length - 1);
+    return root;
+}
+
+/* Driver Code */
+const preorder = [3, 9, 2, 1, 7];
+const inorder = [9, 3, 1, 2, 7];
+console.log('前序遍历 = ' + JSON.stringify(preorder));
+console.log('中序遍历 = ' + JSON.stringify(inorder));
+const root = buildTree(preorder, inorder);
+console.log('构建的二叉树为：');
+printTree(root);