Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g1101_1200.s1104_path_in_zigzag_labelled_binary_tree.Solution

```
public class Solution
extends Object
```
1104 - Path In Zigzag Labelled Binary Tree.
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.

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

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  List<Integer> pathInZigZagTree(int label)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

pathInZigZagTree

public List<Integer> pathInZigZagTree(int label)