Reported interview periodDec 2025–Jul 2026
Column order of a binary tree
Rebuild a binary tree from its level-order serialization, then group the node values by column, moving left to right across columns. Inside one column the values should follow the order in which a breadth-first…
Practice focusRequirements - The first line is a level-order serialization separated by commas. A missing child is written as null , and the whole line may optionally be wrapped in square brackets. An empty line or [] means there is no tree. - Children attach in queue order: each non-null node consumes the next two slots as its left child and then its right child. - The root sits in column 0; a left edge shifts the column by -1 and a right edge by +1 . - Emit one inner list per occupied column, ordered from the smallest column offset to the largest.…