45 lines
1.4 KiB
JavaScript
45 lines
1.4 KiB
JavaScript
/**
|
|
* File: build_tree.js
|
|
* Created Time: 2023-07-30
|
|
* Author: yuan0221 (yl1452491917@gmail.com)
|
|
*/
|
|
|
|
const { printTree } = require('../modules/PrintUtil');
|
|
const { TreeNode } = require('../modules/TreeNode');
|
|
|
|
/* Build binary tree: Divide and conquer */
|
|
function dfs(preorder, inorderMap, i, l, r) {
|
|
// Terminate when subtree interval is empty
|
|
if (r - l < 0) return null;
|
|
// Initialize root node
|
|
const root = new TreeNode(preorder[i]);
|
|
// Query m to divide left and right subtrees
|
|
const m = inorderMap.get(preorder[i]);
|
|
// Subproblem: build left subtree
|
|
root.left = dfs(preorder, inorderMap, i + 1, l, m - 1);
|
|
// Subproblem: build right subtree
|
|
root.right = dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r);
|
|
// Return root node
|
|
return root;
|
|
}
|
|
|
|
/* Build binary tree */
|
|
function buildTree(preorder, inorder) {
|
|
// Initialize hash table, storing in-order elements to indices mapping
|
|
let inorderMap = new Map();
|
|
for (let i = 0; i < inorder.length; i++) {
|
|
inorderMap.set(inorder[i], i);
|
|
}
|
|
const root = dfs(preorder, inorderMap, 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('Pre-order traversal =' + JSON.stringify(preorder));
|
|
console.log('In-order traversal =' + JSON.stringify(inorder));
|
|
const root = buildTree(preorder, inorder);
|
|
console.log('The built binary tree is:');
|
|
printTree(root);
|