review: construct binary tree from preorder and inorder traversal

Author: wogha95

construct-binary-tree-from-preorder-and-inorder-traversal/wogha95.js

@@ -19,10 +19,6 @@ var buildTree = function (preorder, inorder) {
     return null;
   }
 
-  if (inorder.length === 1) {
-    return new TreeNode(inorder[0]);
-  }
-
   const rootValue = preorder[0];
   const leftNodeLength = inorder.findIndex((value) => value === rootValue);
   const leftNode = buildTree(