Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1104. Path In Zigzag Labelled Binary Tree
Given a node label in an infinite binary tree whose rows alternate left-to-right and right-to-left labeling, return the sequence of labels from the root to that node. The core challenge is to account for the per-level zigzag mirroring by mapping labels to their equivalent normal binary-tree indices (and vice versa) to trace ancestors up the tree.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.