Rajesh Pandian razniceguy
razniceguy
/ binary-tree-from-arrays.js
Created
December 8, 2021 02:41
Creates a binary tree from one dimensional array and checks the largest branch from the root recursively.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function getSolution(arr) { | |
| if (Array.isArray(arr)) { | |
| if (arr.length <= 1) { | |
| return ''; | |
| } else { | |
| const left = getSumOfBranch(arr, 2); | |
| const right = getSumOfBranch(arr, 3); | |
| return (left === right) ? '' : ((left > right) ? 'Left' : 'Right') | |
| } | |
| } else { |