Add solution #1104

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,135 LeetCode solutions in JavaScript
+# 1,136 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -878,6 +878,7 @@
 1095|[Find in Mountain Array](./solutions/1095-find-in-mountain-array.js)|Hard|
 1096|[Brace Expansion II](./solutions/1096-brace-expansion-ii.js)|Hard|
 1103|[Distribute Candies to People](./solutions/1103-distribute-candies-to-people.js)|Easy|
+1104|[Path In Zigzag Labelled Binary Tree](./solutions/1104-path-in-zigzag-labelled-binary-tree.js)|Medium|
 1108|[Defanging an IP Address](./solutions/1108-defanging-an-ip-address.js)|Easy|
 1122|[Relative Sort Array](./solutions/1122-relative-sort-array.js)|Easy|
 1123|[Lowest Common Ancestor of Deepest Leaves](./solutions/1123-lowest-common-ancestor-of-deepest-leaves.js)|Medium|

solutions/1104-path-in-zigzag-labelled-binary-tree.js

@@ -0,0 +1,31 @@
+/**
+ * 1104. Path In Zigzag Labelled Binary Tree
+ * https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/
+ * Difficulty: Medium
+ *
+ * In an infinite binary tree where every node has two children, the nodes are labelled
+ * in row order.
+ *
+ * In the odd numbered rows (ie., the first, third, fifth,...), the labelling is left to right,
+ * while in the even numbered rows (second, fourth, sixth,...), the labelling is right to left.
+ *
+ * Given the label of a node in this tree, return the labels in the path from the root of the
+ * tree to the node with that label.
+ */
+
+/**
+ * @param {number} label
+ * @return {number[]}
+ */
+var pathInZigZagTree = function(label) {
+  const result = [];
+  let current = label;
+
+  while (current >= 1) {
+    result.unshift(current);
+    const level = Math.floor(Math.log2(current));
+    current = Math.floor(((2 ** (level + 1)) - 1 + (2 ** level) - current) / 2);
+  }
+
+  return result;
+};