human
I found an interesting problem on https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/:
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.
 
Example 1:
Input: label = 14
Output: [1,3,4,14]

Example 2:
Input: label = 26
Output: [1,2,6,10,26]

 
Constraints:

1 <= label <= 10^6

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python code you requested.

class Solution:
    def pathInZigZagTree(self, label: int) -> List[int]:
        x=bin(label)[2:]
        n = len(x)
        #invert path
        y=\"1\"
        for i in range(1, n): y += \"0\" if x[i] == \"1\" else \"1\"
        #Follow path in odd even fashion
        out = []
        for i in range(n):
            if n%2 == 0:
                if i % 2 == 1: out.append(int(x[:i+1], 2))
                else: out.append(int(y[:i+1], 2))
            else:
                if i % 2 == 0: out.append(int(x[:i+1], 2))
                else: out.append(int(y[:i+1], 2))
        return out