1104. 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

# @lc code=start
using LeetCode

function path_in_zig_zag_tree(n::Int)
    res = Int[]
    layer = floor(Int, log2(n)) + 1
    while layer != 0
        push!(res, n)
        b = (1 << layer) + (1 << (layer - 1)) - 1
        iseven(layer) && (n = b - n)
        n >>= 1
        layer -= 1
        iseven(layer) && (n = (b >> 1) - n)
    end
    reverse!(res)
    return res
end
# @lc code=end

path_in_zig_zag_tree (generic function with 1 method)

This page was generated using DemoCards.jl and Literate.jl.