N-ary Tree Level Order Traversal

Given an N-ary tree serialized in level-order form with -1 separators between sibling groups (e.g. [1,-1,3,2,4,-1,5,6]), return its level-order traversal as a list of value levels. N-ary Tree Level Order Traversal Given an N-ary tree serialized in level-order form with -1 separators between sibling groups (e.g. [1,-1,3,2,4,-1,5,6]), return its level-order traversal as a list of value levels. SWE tree tree-traversal bfs medium Frequency Single report Last asked 2026-02-12 Stage phone-screen N-ary Tree Level Order Traversal This version receives the N-ary tree in level-order form using -1 separators between sibling groups, for example [1,-1,3,2,4,-1,5,6]. Return the level order traversal of the tree values. Examples Example 1: Input: serialized = [1,-1,3,2,4,-1,5,6] Output: [[1],[3,2,4],[5,6]] Constraints 0 <= serialized.length <= 10^4 Node values are non-negative and -1 is reserved as the separator marker.