/* function TreeNode(x) { this.val = x; this.left = null; this.right = null; } */ function reConstructBinaryTree(pre, vin) { // write code here n = pre.length; m = vin.length; if(n === 0 && m === 0) return null; let root = new TreeNode(pre[0]); for(let i=0;i<vin.length;i++){ if(vin[i] === pre[0])...