1
class Solution:
2
    def pathInZigZagTree(self, label: int) -> List[int]:
3

4
        x = label
5
        mask = 0
6
        while x > 1:
7
            x >>= 1
8
            mask <<= 1
9
            mask |= 1
10

11
        x = label
12
        res = deque()
13
        while x:
14
            res.appendleft(x)
15
            x >>= 1
16
            mask >>= 1
17
            x ^= mask
18
        return res