Fixed handling of poorly constructed Binary Max Heaps

bradhanson · bradhanson · commit 32a8777a069f · 2018-08-05T09:24:47.000-04:00
diff --git a/medium/binary_tree_lca.js b/medium/binary_tree_lca.js
@@ -33,7 +33,7 @@ function binaryTreeLca(strArr) {
 
     // Find LCA
     for (let i = 0; i < nodeAPath.length; i++) {
-        if (nodeBPath.includes(nodeAPath[i])) {
+        if (nodeBPath.includes(nodeAPath[i]) && nodeAPath[i] !== '#') {
             return Number(nodeAPath[i]);
         }
     }

Original file line number	Diff line number	Diff line change
`@@ -33,7 +33,7 @@ function binaryTreeLca(strArr) {`
`33`	`33`
`34`	`34`	`// Find LCA`
`35`	`35`	`for (let i = 0; i < nodeAPath.length; i++) {`
`36`		`- if (nodeBPath.includes(nodeAPath[i])) {`
	`36`	`+ if (nodeBPath.includes(nodeAPath[i]) && nodeAPath[i] !== '#') {`
`37`	`37`	`return Number(nodeAPath[i]);`
`38`	`38`	`}`
`39`	`39`	`}`